(Recursive sequential search) The sequential search algorithm given in this chapter is nonrecursive. Write and implement a recursive version of the sequential search algorithm.

Below is the sequential search algorithm provided by the book:

template int seqSearch(const elemType list[], int length, { const elemType& item) int loc; bool found = false; loc = 0; while (loc < listLength && !found) if (list[loc] == item) found = true; else loc++; if (found) return loc; else return -1; } //end seqSearch