In Fibonacci's model, rabbits live forever. The following modification of Definition 3.1 accounts forif n ≤ 0if n = 1 or n = 2G(n) = 1(a) Compute G(n) for n = 1, 2, ..., 12.G(1)G(2)G(3)G(4)G(5)G(6)G(7)G(8)G(9)G(10)G(11)G(12)========G(n-1) + G(n − 2) - G(n - 8) if n > 2.-=(b) In this modified model, how long do rabbits live?months

Algorithm: let function(n)// is a function having a single parameter as n Now according to the above modification if n<=0// n is less than or equal to zero. return 0; if n ==1 or n== 2 // if n =1 or n=2 return 1 else : //we will call the function recursively return function(n-1)+function(n-2)-function(n-8) end function Below is the trace table for function for values n = 1 to 12. Recursive call for n value G(1) = 1 G(2) = 1 G(3) = 2 G(4 ) = 3 G(5) = 5 G(6) = 8 G(7) = 13 G(8) = 21 G(9) = 33 G(10) = 53 G(11) = 84 G(12) = 134G(1) = 1 G(2) = 1 G(3) = 2 G(4 ) = 3 G(5) = 5 G(6) = 8 G(7) = 13 G(8) = 21 G(9) = 33 G(10) = 53 G(11) = 84 G(12) = 134def function(n): if n <=0: return 0 if n ==1 or n ==2: return 1 return function(n-1)+function(n-2)-function(n-8) def checkingValues(): for i in range(1, 13): print("G("+str(i)+") = "+str(function(i))) checkingValues()As in the table or output, we can see that a pattern is formed while calling the function from value 1 to 12. And the pattern seems to be the same Fibonacci series. And in question, it is mentioned that in the Fibonacci model rabbit lives forever. So here also the rabbit will live forever.

Engineering

Computer Science

In Fibonacci's model, rabbits live forever. The following modification of Definition 3.1 accounts fo if n ≤ 0 if n = 1 or n = 2 G(n) = G(n-1) + G(n-2) (a) Compute G(n) for n = 1, 2, ..., 12. G(1) G(2) G(3) G(4) G(5) G(6) G(7) G(8) G(9) G(10) G(11) G(12) = = = = = G(n-8) if n > 2. (b) In this modified model, how long do rabbits live? months

In Fibonacci's model, rabbits live forever. The following modification of Definition 3.1 accounts fo if n ≤ 0 if n = 1 or n = 2 G(n) = G(n-1) + G(n-2) (a) Compute G(n) for n = 1, 2, ..., 12. G(1) G(2) G(3) G(4) G(5) G(6) G(7) G(8) G(9) G(10) G(11) G(12) = = = = = G(n-8) if n > 2. (b) In this modified model, how long do rabbits live? months

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Suppose that f(n) ≤ 5g (n) for all n. Then we can certainly conclude that Of(n) = (g(n)) Of(n) =…

A: Performing a complexity analysis on an algorithm is crucial for developing new ones. To a large…

Q: Solve the recurrence below in the same style as done in lecture. Simplify any formula you get.…

A: The question is solved in step2

Q: Overflows You have learned the concept of overflow (with say n! that overflows at 13! for integer)…

A: In fibonacci series next number is the sum of previous two numbers.

Q: Which of these statements is false regarding this: T(n) = O(f(n)) means that O O O O T(n) is an…

A: In algorithm analysis and Big O notation, T(n) represents the time taken or the number of operations…

Q: Prove that 0(n -1) +0(n)= 0(n). Does it follow that 0(n)= 0(n)-0(n -1)? Justify your answer

A: Given that, O(n)=O(n-1)+O(n) and O(n)=O(n)-O(n-1) Big O represents the worst case time complexity…

Q: True/False? Let f(n)=O(g(n)) and g(n)=O(T(n)). Is this true that f(n)=O(T(n))? Prove your claim and…

A: Asymptotic notation is a mathematical framework used to describe the behavior of functions as their…

Q: Understand the running order of 7 functions O(1), O(n log n), O(n), O(n2 ), O(n3 ), O(log n), O(an…

A: The asymptotic upper bound of a function, often denoted using "big-Oh" notation (O()), can be…

Q: If set A has size m, and set B has size n, then what is the size of the cross product of A and B?…

A: Introduction: A set is a collection of distinct and well-defined objects, which can be numbers,…

Q: : a. [(a mod n) - (b mod n)] mod n = (a - b) mod n

Q: Let d p(n) = [a¡n', i=0 where ad > 0, be a degree-d polynomial in n, and let k be a constant. Use…

A: SOLUTION - e. If k <d, then p(n) = w(nk). Below I have added the image of the solution -…

Q: a. If t(n) = O(g(n)), then g(n) = N(t(n)). b. 9(ag(n)) = 8(g(n)), where a > 0. c. O(g(n)) = O(g(n))…

Q: Prove or disprove the following statements: 1)Suppose that f(n) = Θ(nlogn) and g(n) = Θ(n2/logn).…

A: 1. The given statement can be prove f(n) = Θ(nlogn) and g(n) = Θ(n2/logn). Then, h(n) = f(n) x g(n)…

Q: An electrician has wired n lights, all initially on, so that: 1) light 1 can always be turned…

A: IMPLEMENTATION: The algorithm works from left to right implementing individual bits. First bit can…

Q: for ( i = 1 ; i < n ; i * 2 ){ for ( j = 0 ; j < min( i , k ) ; j++){ sum++…

A: Time complexity = O(n^2)

Q: Determine the running time for each recursive functions 1. T(n) = T([n/2]) + 1 2. T(n) = T(n-1) +…

A: Introduction: The running time of a recursive function is the amount of time it takes to execute the…

Q: The power function can be defined as follows: What is the worst-case running time complexity of…

A: So Below is the answer to this question. Time complexity is most important for every algorithm,…

Q: Following, we can consider the number f(n) of perfect matchings in a 3 × 2n grid graph, which is the…

Q: Tom and Jerry being bored in this pandemic, decides to play a game. Given an integer N. On each…

A: Write an algorithm for the given problem, algorithm should be of constant space and time complexity.…

Q: Master theorem: if n<d T(n)= { |aT(n/b)+ f (n) if n2 d 1. if f(n) is O(n08, «-e 2. if f(n) is O(no%,…

A: Master Theorem:

Q: Show that f(n) is Θ(g(n)) for the correct function g(n). Prove your result using the definitions…

A: f(n) = n 1.5 log(2n) + n 2 log(n 2 ) + √ n:-

Q: (n + 1)! - 1 + (n + 1)(n + 1)! = (n + 2)! -1

A: n! = n*(n-1)*(n-2)*........*1 (n+1)! = (n+1)*n*(n-1)*(n-2)*........*1 (n+2)! =…

Q: Let f,g:Z+⟶R, and f(n)=nlog2(n)for n∈Z+. For which function g(n) below is f∉O(g). Group of answer…

A: Given that, f,g:Z+⟶R, and f(n)=nlog2(n) for n∈Z+ and also f∉O(g) That means we want g(n) which is…

Q: function, indicate the c

A: Asymptotic Notation is used to determine the running time of the algorithm written - how much time…

Q: uppose that f(n) = 0(g(n)) and f(n) = 0(h(n)), then it is ( always / sometimes / never) the case…

A: Defined the given statement always, sometimes or never

Question

In Fibonacci's model, rabbits live forever. The following modification of Definition 3.1 accounts for
if n ≤ 0
if n = 1 or n = 2
G(n) = 1
(a) Compute G(n) for n = 1, 2, ..., 12.
G(1)
G(2)
G(3)
G(4)
G(5)
G(6)
G(7)
G(8)
G(9)
G(10)
G(11)
G(12)
=
=
=
=
=
=
=
=
G(n-1) + G(n − 2) - G(n - 8) if n > 2.
-
=
(b) In this modified model, how long do rabbits live?
months

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Explanataion

VIEW

Answer a)

VIEW

Python program

VIEW

Output of the above equation

VIEW

B) how long does the rabbit live

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 5 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Explain, with an example why the following definition, would not be suitable or useful: f(n) is Ω( g(n) ) if and only if there exists n0, such that:forall n ≥ n0, there exists c > 0 such that,f(n) ≥ c g(n)
Solve the following recurrences exactly:(a) T(1) = 8, and for all n ≥ 2, T(n) = 3T(n − 1) + 15.(b) T(1) = 1, and for all n ≥ 2, T(n) = 2T(n/2) + 6n − 1 (n is a power of 2)
2) Prove divisible by 3 for any integer nzo. that n(n²+s) is divisible by 3 for Let n 1 1 (1² +5) = 1(1+5)=(6/ K(K²+5) K+ 1 ((k + 1 ) ² + 5
This is JAVA Programming
There are m towns in a straight line, with a road joining each pair of consecutive towns. Legends say that an ordinary person in one of these towns will become a hero by completing a sequence of n quests. The first quest will be completed in their home town, but after each quest they may complete their next quest either in the same town or after moving to a neighbouring town.For example, if n = 5 and m = 4, a resident of town 2 may become a hero as follows:• begin in town 2 for quest 1,• then move to town 3 for quest 2,• stay in town 3 for quest 3,• return to town 2 for quest 4, and• move to town 1 for quest 5.Design an algorithm which runs in O(nm) time and finds the total number of waysto complete n quests.
Prove the following by induction, substitution, or by definition that 13n+ 10 = O(n²). Definition of Big O f(n) = O(g(n)) means there are positive constants c and no, such that ≤ f(n) ≤ cg(n) for all n ≥ no.
a = 0; for i in range(N): for j in reversed(range(i,N)): a = a + i + j; O(N^N) O(N*N) O(N/2) O(logN)
DO NOT COPY FROM OTHER WEBSITES Correct and detailed answer will be Upvoted else downvoted directly. Thank you!
Find f(1), f(2), f(3), f(4), and f(5) if f(n) is defined re-cursively by f(0) = 3 and for n = 0, 1, 2, ... a) f(n + 1) = −2f(n).b) f(n + 1) = 3f(n) + 7.
Prove by induction that fib(0)+fib(1)+…+fib(n) = fib(n+2)-1, fib(0)=0 fib(1)=1