What is the asymptotic performance time of the following algorithm when the input size is n? First, put the T(n) in the ignition state and then find the answer.

1)

2)

sample (A[], n) { if (n=1) return 1; sumo; for i=1 to n sum sum + A[i]; tmp sum + sample (A, n-1); return tmp; sample (A[]. p. r) { if (p=r) return 1; sum 0; for i=1 to n sum sum + A[i]; 9-1(p+r)/2]; tmp-sum + sample (A, p. 9) + sample (A, 9+1, r); return tmp