An investment company guarantees a 2% monthly compounded return on your investment. You want to see how long it takes to reach a total of $500,000 dollars in investment plus return. Write a program that allows the user to enter a continuous monthly investment (Example - $200 every month) or ($600 every month). The program should call a recursive method that returns and displays the total months needed to reach the $500,000 dollar goal. Example - At the 2% compounded monthly rate, and a $400 continuous monthly investment, the first month the user makes $8 interest and has $408.00 dollars, the second month the user adds $400 and makes $16.16 interest and now has $824.16, the third month the user adds $400 and makes $24.48 in interest and now has $1,248.64 dollars, etc. Display how many total months it takes the user to reach the $500,000 dollar goal. Remember, the user should be able to input the continuous monthly investment. The rate is always 2% and compounded monthly.

You should try to photograph people on bright sunny days because the light will be best a) true b) false

For this assignment you have to write a c program that will take an infix expression as input and display the postfix expression of the input. after converting to the postfix expression, the program should evaluate the expression from the postfix and display the result. what should you submit? write all the code in a single file and upload the .c file. compliance with rules: ucf golden rules apply towards this assignment and submission. assignment rules mentioned in syllabus, are also applied in this submission. the ta and instructor can call any students for explaining any part of the code in order to better assess your authorship and for further clarification if needed. problem: we as humans write math expression in infix notation, e.g. 5 + 2 (the operators are written in-between the operands). in computer's language, however, it is preferred to have the operators on the right side of the operands, ie. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix write a program that takes an "infix" expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % ( example infix expression: (7-3)/(2+2) postfix expression: 7 3 2 2 result: rubric: 1) if code does not compile in eustis server: 0. 2) checking the balance of the parenthesis: 2 points 3) incorrect postfix expression per test case: -2 points 4) correct postfix but incorrect evaluation per test case: -i points 5) handling single digit inputs: maximum 11 points 6) handling two-digit inputs: 100 percent (if pass all test cases)

Explain the importance of html in web page designing in 20 sentences..