Recursion

a) For each of the following problems, what is the recursive step and what is the base case? Answer in one sentence; no need to write C++ code: i) Traversing an SLL to find the first element less than a given value, find(ptr, value) Recursive Step: Base Case: ii) Returning the sum of the first K elements in an array of size N, sum(array, N, K, index) Recursive Step: Base Case: