Problem FIG can be solved in O(RK + R log log n) time using θ(R) space.Write Algorithm for it

Solve the following recurrences using iteration methods and Master's Theorem (if possible) a. T(n) = 2T (n/3) +3 b. T(n) = 3T (n/6) + n

Computer Algorithms Obtain the complexity of the program fragment below   for i <-- 1 to n do k <-- n while K > 1 do K <-- k/2 while (k) end-while end-for

An evil king has n bottles of wine, and a spy has just poisoned one of them. Unfortunately, they do not know which one it is. The poison is very deadly; just one drop diluted even a billion to one will still kill. Even so, it takes a full month for the poison to take effect. Design a scheme for determining exactly which one of the wine bottles was poisoned in just one month’s time while expending O(log n) taste testers.