1. Permutation (12 pts) a. (3 pts) Please show the output of the function in serial. Assume the initial state of the array is {1 2 3} and k-0, m=2. b. (7 pts) Please show the recursive function in order to compute the time complexity of the function and give the answer of the function. Assume the dimension of the array in n and it takes O(1) to swap two elements (i.e., swap(a[k], a[i]). C. (2 pts) Is this program a polynomial time algorithm? void Function (char*a, const int k, const int m) { if( km) { // output permutation cout