how can derive recurrence relations and prove it their time complexity is (logn) ; explain it;

What function of r, n is computed by this program? Function what(x, n:integer): integer: Var value integer begin value1 if n0 then begin if n mod 2 1 then valuevalue x; valuevalue what (x*x, n div 2); end what value; end