#2 Suppose we know that an algorithm has 5 classes of complexity for a problem of size n. The complexities Ti(n) .. Ts(n) are given below. Regarding probabilities, suppose that piis twice as likely as P2, P2 is twice as likely as p3, , P3 is twice as likely as P4 and P4 is twice as likely as ps. T; for all instances: T(n) = n, T2(n) = 2n, T3(n) =3n4, T.(n) = 4n and Ts(n) = 5n (a) Find all five probabilities P1, P2, P3, P4, P. (Hint: the sum of all probabilities equal 1.0] (b) Find the A(n) for the algorithm