) Read the following JAVA method:

public static void foo(int n, char A, char B, char C) {

if (n<=0) return; // primitive operation

foo(n-2, A, C, B);

System.out.println(n= + n); // primitive operation

foo(n-2, B, A, C);

}

a. Describe the analytical time complexity T(n) of this method using (show your work);

b. Use proof-by-induction to demonstrate the analytical time complexity.