PLEASE EXPLAIN THANKS

Search l 12:57 For x>=2, and rand(x) is function that takes x from 1 to x-1. And max(x,y) output bigger value and min(x,y) output smaller value Find the worst case complexity of each algorithm Algorithm A Input=n X=n WHILE X>=2 y=rand(x) X=max(y,x-y) ALGORITHM B Input =n X=n While x>=2 Y=rand(x) X=min(y,x-y) ALGORITHM c void fn(x :int) {if(x>=2) Y=rand(x) Fn(y) Fn(x-y) Else Return } Fn(n)