can I get help on these two questions please and thank you

Write a recurrence relation describing the worst case running time of each of the following algorithms, and determine the asymptotic complexity of the function defined by the recurrence relation. Show your work; you may NOT use the Master Theorem.

P4 procedure p(n) begin if n s 20 then return(n); x pA(n-1); i=1; n while is do begin san; is 3i end; P4 return( pd(n-10) ) end. procedure ps(n) begin if n s 20 then return(loglogn]); 1/3 for i=1 to [n"3] do x-17+x ; return( ps(n-5)) n- end