1. Given a String of words seperated by spaces and a number K, return the original String broken up into lines, such that no line has more than K characters and each line contains the maximum number of words that can fit. \n\nExample Input:\n```\n"His dog chases her cat", 15 \n```\n\nOutput: \n```\nHis dog chases\nher cat\n```\n\n2. You will write a program to ingest a user\'s current invesments, their historical activity, and assess which of their investments have had the best returns. You are given an input file that is divided into two sections: Current holdings and trades\n\nExample input file:\n```\n3\n4 AAPL valued $100 each\n10 SPY valued $200 each\n20 BND valued $150 each\n5\nbought 10 AAPL at $300\nsold 6 AAPL at $250\nbought 5 SPY at $50\nbought 5 SPY at $75\nbought 20 BND at $145\n```\n\nExample output:\n```\nTotal $275\nSPY $1375\nBND $100\nAAPL -$1100\n```\n\n- Holders per share plus total sells per share minus total buys per share will equal 0\n- If a symbol shows up in either the holding or trade, it should show up in the output.\n- A symbol may be excluded from the holdings if the total shares bought equals the total shares sold.\n- Output should be sorted by reverse order of the gain.\n\n\n

Given a String of words seperated by spaces and a number K, return the original String broken up into lines, such that no line has more than K characters and ea