Fibonacci sequence is simple yet magic, which is composed of 1, 1, 2, 3, 5, 8,...

 

Transcribed Image Text:

Fibonacci sequence is simple yet magic, which is composed of 1, 1, 2, 3, 5, 8, 13, 21, 34, The first two numbers in that sequence are both 1. Starting from the third number, the value is determined by adding up the last two predecessors. The prompt should be "Please enter a number: The output should be formatted as "{d}" SJ In this task, the program gets a number n from the user (1 ≤n≤30), and prints the n-th value in the Fibonacci sequence. The value must be calculated by recursive function, and no loop is allowed. 13 84 126 126 84 36 10 45 120 210 252 210 120 45 10 Example2 Please enter a number: 20 6765 NOTE: you should strictly follow the prompt/output format to get full marks. Also, you should define a function whose name is "monalisafib" (refer to the OnlineGDB template). Example (The contents highlighted by brown ink are inputs from the user): Please enter a number: 10 55 Fibonacci sequence is simple yet magic, which is composed of 1, 1, 2, 3, 5, 8, 13, 21, 34, The first two numbers in that sequence are both 1. Starting from the third number, the value is determined by adding up the last two predecessors. The prompt should be "Please enter a number: The output should be formatted as "{d}" SJ In this task, the program gets a number n from the user (1 ≤n≤30), and prints the n-th value in the Fibonacci sequence. The value must be calculated by recursive function, and no loop is allowed. 13 84 126 126 84 36 10 45 120 210 252 210 120 45 10 Example2 Please enter a number: 20 6765 NOTE: you should strictly follow the prompt/output format to get full marks. Also, you should define a function whose name is "monalisafib" (refer to the OnlineGDB template). Example (The contents highlighted by brown ink are inputs from the user): Please enter a number: 10 55