1) Trace this recursive function when x=5: int func(int x) { if(x==1) return 1; return func(x-1) * x; } 2) State the Big-O time complexity of this function