Consider the following algorithm segment. For each positive integer n, let b. be the number of iterations of the while l

[answerhappygod]

Consider The Following Algorithm Segment For Each Positive Integer N Let B Be The Number Of Iterations Of The While L 1 (16.17 KiB) Viewed 46 times

Consider the following algorithm segment. For each positive integer n, let b. be the number of iterations of the while loop while (n> 0) nn div 3 end while (a) Which of the following is an order for the algorithm segment? Ⓒe(²¹) (²) O 9(log(n)) O 0(log (3)) Ⓒe(3) (b) Write a free response that shows the work that led to your answer for part (a). The steps will be similar to the ones oerbed examples 11.5.2, 11.5.3, 11.5.4, 1155, and 11.5.6. See the subsection The Efficiency of the Binary Search Algorithm in the "Rad It" link. (Submit a file with a maximum size of 1 MB.) Choose File No file chosen This answer has not been graded yet