I need the answer for Question 2 only 97% 9:30 AM QUESTION 1 5 points Save Answe

Question

I need the answer for Question 2 only

97% 9:30 AM QUESTION 1 5 points Save Answer What are the next three elements in the following fibonacci sequence: 1, 5, 6,11, 17, 23, 29, 34 28, 45, 73 24, 32, 41 22, 37, 49 QUESTION 2 5 points Save Answer We examined the Towers of Hanoi problem this semester. If we want to move 7 disks from one peg to another peg, what is the optimal numbers of moves needed? 63 127 1023 2047 QUESTION 3 5 points Save Answer Click Save and Submit to save and submit. Click Save All Answers to save all answers

Explanation / Answer

1. fib(n)=fib(n-1)+fib(n-2). Therefore answer is (B) 1,5,6,11,17,28,45,73

2. minimal moves required to move n disks is 2n-1.

n=7

therefore, 27-1=127 option(C)

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---