Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

The program shall consist of two .cpp files: Lab09.cpp and MyMath.cpp. There sha

ID: 3567664 • Letter: T

Question

The program shall consist of two .cpp files: Lab09.cpp and MyMath.cpp. There shall also be one .hpp file named MyMath.hpp.

The program shall display a menu with three menu items,

What would you like to do?

1. Compute the a-th root of a number.

2. Compute the n-th Fibonacci number.

3. Quit the program.

Choice? 1

and prompt the user to select menu item 1, 2, or 3. If the user selects menu item 1, the program shall prompt the user to enter

values for n and a,

Your choice is to compute the a-th root of n.

Enter n (>= 0): 13512

Enter a (>= 2): 5

The 5-th root of 13512.0000000000000000 is 6.7010664923861052

and it shall compute and display the a

th root of n (configure cout to display real number in fixed notation with 16 digits after the

decimal point). After displaying the result, the program shall display the menu again,

What would you like to do?

1. Compute the a-th root of a number.

2. Compute the n-th Fibonacci number.

3. Quit the program.

Choice? 2

and prompt the user to select menu item 1, 2, or 3. If the user selects menu item 2, it shall prompt the user to enter a value for n,

Your choice is to compute the n-th Fibonacci number.

Enter n (>= 0): 22

The 22-th Fibonacci number is 17711

and shall display the n

th Fibonacci number. After displaying the result, the program shall display the menu again. It shall continue this

process of displaying the menu, performing the selected operation when menu items 1 or 2 are selected. When the user selects

menu item 3, the program shall terminate,

What would you like to do?

1. Compute the a-th root of a number.

2. Compute the n-th Fibonacci number.

3. Quit the program.

Choice? 2

Your choice is to compute the n-th Fibonacci number.

Enter n (>= 0): 22

The 22-th Fibonacci number is 17711

What would you like to do?

1. Compute the a-th root of a number.

2. Compute the n-th Fibonacci number.

3. Quit the program.

Choice? 2

Your choice is to compute the n-th Fibonacci number.

Enter n (>= 0): 46

The 46-th Fibonacci number is 1836311903

What would you like to do?

1. Compute the a-th root of a number.

2. Compute the n-th Fibonacci number.

3. Quit the program.

Choice? 3

Bye.

Explanation / Answer

// fibo_recursion_simple.cpp // finding nth Fibonacci number #include #include using namespace std; unsigned long fibo(unsigned long n); int main() { int n; unsigned long answer; cout > n; answer = fibo(n); cout