using fewer than / comparisons (hintfirst construct group of candidate minimums and group of candidate maximums - bob built web site and gave the url only to his friendswhich he numbered from to he told friend number that he/she can visit the web site at most times now bob has counterckeeping track of the total number of visits to the site (but not the identities of who visitswhat is the minimum value for such that bob should know that one of his friends has visited his/her maximum allowed number of timesc- consider the following "justificationthat the fibonacci functionf( (see proposition is ( ):base case ( < ) ( and ( induction step ( )assume claim true for consider (nf( ( by inductionf( is ( and ( is ( thenf(nis (( ( ))by the identity presented in exercise - thereforef(nis (nwhat is wrong with this "justification" - let (xbe polynomial of degree nthat is, ( (adescribe simple ( time method for computing ( (bnow consider rewriting of (xas (xa ( + ( ( ( - +xa )))which is known as horner' method using the big-oh notationcharacterize the number of arithmetic operations this method executes - consider the fibonacci functionf( (see proposition show by induction that (nis ohm(( / )nc-