Try to analyze the following algorithm. Function Foo(n) if n > 1 then Print 'A' Foo(n/3) for i from 1 to n do Print 'B' end Foo(n/3) end a) What is the running time of the function Foo(n)? Give detailed steps to obtain the asymptotic running time in big- theta notation. b) How many 'A's will be printed by Foo(n)? Give detailed steps to obtain your solution in big- theta notation (in terms of n)