restion 3: Find the Running Time Find a function f(n) such that the algorithm runs in time (f(n)) for each algorithm below. You should explain the reasoning behind your answer but you do not need to give a formal proof. \begin{tabular}{l} Algorithm 1 \\ \hline Foo(n): \\ if n>1: \\ Foo( n2) \\ Foo( n2) \\ \hline Algorithm 2 \\ \hline Bar(n): \\ x=0 \\ for i=1,2,,n : \\ x=x+i \\ while x>0: \\ x=x1 \end{tabular}