use python:

Part1: https://www.chegg.com/homework-help/questions-and-answers/21-experimental-analysis-part-1-common-loop-appears-programming-problems-partial-double-lo-q38816417

Part2: https://www.chegg.com/homework-help/questions-and-answers/22-experimental-analysis-part-2-many-functions-look-defined-recursively-merge-sort-general-q38828542

2.3 Experimental Analysis (Part 3) Repeat the analysis you did in parts 1 and 2 using a new function. The recursive formula for Binary Search is T (1) T(n) = 1 = T (n/2) + 1 Compare this function to (Ig n, n Ign, 1/2 * n^2) An example output is provided below. Analysis of Second Recursive Function Enter starting power of 2: Enter final power of 2: T (n) lg n n lg n 1/2n^2 s N Nm 00 See which of the common running times comes closest to T(n)