Linear searches are an iterative process where the program steps through each item in the list until it

finds the one it is looking for. These searches are usually written with a basic while loop. In this

exercise, the search is implemented with a recursive method.

Unfortunately, the program contains some bugs. Your job is to fix these bugs to so the program works

correctly and can pass the autograders.

The intended function is to search the list for a target value. If that target is found, return the index

where the target is$.$ If the target is found more than once, return the maximum index. If the target is

not found, return $-1.$

Examples:

The recursive method takes three parameters, the list, the maximum index to search, and the target

value. The program is use a kickoff method that takes the list and the target and creates the initial

recursive call by adding the maximum list index to the call.

You will need to take time to understand what the code is doing and how it is not functioning correctly.

After that, you will need to fix the code.