4- Give a bound on the value of x as a function of n for the following algorithms: F(n) 1 x 0 2 is n 3 while i> 0 do 4 ii/2 5 X+X+ 10 6 return x G(n) 1 x 0 2 for i+ 1 to log(n) do 3 j-2 4 while j