A = payment Amount per period P = initial Principal (loan amount) r= interest rate per period n= total number of payments or periods Example: What would the monthly payment be on a 15-year, $100,000 loan with a 4.50% annual interest rate? P = $100,000 r= 4.50% per year / 12 months = 0.375% (or 0.00375) per period n = 15 years * 12 months = 180 total periods A = 100,000 * (.00375 * (1 + .00375)180)/((1+.00375)!80 – 1)

Write a C++ program with a function named num_type() that takes one parameter of type float and return -1 if the parameter is negative, 0 if the parameter is zero, and 1 if the parameter is positive. Write a main() function that inputs 50 float numbers and finds the sum of positive numbers (use the function num_type).

Write a C++ program that will print the following triangle of numbers in a function. (Please use a function to print it) 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 1 2 3 4 5 6 1 2 3 4 5 6 7 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 9

Suppose that you have the following recursive function written in C++. I've intentionally written the function so that it doesn't use descriptive names for anything, though that's obviously not a good design practice, but I aim not to bias your understanding of the techniques you'll be using by assuming anything about what the function's goal is; to stay "on task" here, you should resist the temptation to try to figure that out first. void kaboom( const std::vector& v, std::vector& w, unsigned int i) { if (i < w.size()) { int q = 0; for (int j : v) { q += j; } w.at(i) - kaboom(v, w, i + 1); } = q; } 1. Using the techniques from our discussion of the Asymptotic Analysis of Recursion, write a recurrence that describes the time required to run the following call to kaboom for two vector v and w whose sizes are the same. Use the variable s in your recurrence to denote that size. kaboom(v, w, 0) 2. Using the repeated substitution technique, reduce the recurrence to a closed form, then give…