You win $2100 from your favorite slot machine, and you decid…

You win $2100 from your favorite slot machine, and you decide to invest the amount at a 4.8% APR for 7 years at Wells Fargo.   A) If your winnings are invested in a simple interest account, how much money will be in the account after 7 years? Enter numbers only. Do not enter the “$” symbol or words. $[simpacct]   B) Instead of a simple interest account, suppose your winnings are invested at 4.8% APR in a compound interest account with monthly compounding. How much money will be in your account after 7 years? Enter numbers only. Do not enter the “$” symbol or words. Do not leave any answer blank.   Fill in the blanks below that correspond to what you would type into the TVM-Solver in your calculator: N = [N] I% = [I] PV  = [PV] PMT = [PMT] P/Y = [PY] C/Y = [CY]   * Enter the future value (FV) that will be in the account after 7 years. Enter numbers only. Do not enter the “$” symbol or words. NOTE: If you decide to use the textbook formula to compute the future value (instead of the TVM-Solver), round intermediate steps to 4 decimal places. Round the final answer to the nearest cent (or 2 decimal places).   The future value of the account after 7 years will be: $[compacct]

Write a recursive implementation of an algorithm that multip…

Write a recursive implementation of an algorithm that multiplies the following two integers stored as strings. For example: 12345 * 6789. The implementation will use a technique such that each digit of the multiplicand (i.e., 12345) is multiplied by each digit of the multiplier while managing the place-value of each digit in the multiplier. For this example, the algorithm will multiply each digit of 12345 by 9 first. Then multiply each digit of 12345 by 8 next (keeping track of the place-value of the 8). Then each digit of 12345 by 7, etc. The purpose of this algorithm is to allow for multiplication of arbitrarily large integers, so casting a digit of the multiplier to and integer and finding the product of that digit and the multiplicand (cast as an integer) will not suffice for this algorithm.  Hint: the recursive case can append an extra “0” to the end of each product.  This implementation of multiplication is not the same implementation as observed in previous assignments. The signature of the function called to multiply the two integers should be as follows: function multiply_strings(num1, num2)