Consider the following function that is not tail recursive, counting the occurrences of a value in an array. You can also find the code in the same source file listed in Exercise 1. 0) int countVal (int A[], int size, int val) { if (size return 0; else if (A[size val) return 1 + countVal(A, size-1, val); else return countVal(A, size 1, val); } 1] For example, if the array A contains {1, 3, 2, 7, 1, 7, 2, 7}, then countVal(A, 8, 7) should return 3. a. Convert this function to a tail-recursive one by adding an extra parameter, as seen in class. b. Convert the resulting tail-recursive function into an iterative one using the transformation described in class