Analyze the runtime for the following function pow by drawing out the recursion tree and computing the file runtime as a Big-O value. (6 points) int pow (int a, int n) ii(n :::: ) { return 1). else t return pow(a,n/2)*pow(a,n/2))