Projects ContentInstructionsYour Programming project 1 includes 2 parts. The first part is about recursion (Chapter 18) while the second part is about linear searching into an array using recursion (Chapter 19). You MUST submit both parts. Each part is 50 points worth (total = 100 points)Part AWrite a method that can be used to test how well a computer performs recursion.Write a method called Recurse(x, y). Use the following logic in your method:If x = 0 then return y + 1If y = 0 then return Recurse(x−1, 1)Otherwise, return Recurse(x−1, Recurse(x, y−1))Test your method in a program that displays the following values:Recurse(0, 0)Recurse(0, 1)Recurse(1, 1)Recurse(1, 2)Recurse(1, 3)Recurse(2, 2)Recurse(3, 2)Part BGo to chapter 19, page 813, figure 19.2, and perform the following:a) Modify the linear search highlighted method to perform a recursive linear search of the array.b) The method should receive the search key and the starting index as arguments. If the search key is found, then return its index in the array. Else, return -1.c) Each call to the recursive method should check one index in the arrayd) Name the recursive method as linearSearchRecursee) Modify the rest of the program as needed. Submit the whole program. When you are done with both parts A and B:Put both files (PartA, and PartB) in a folderSave the folder as FirstName_LastName_Project1 (e.g. Dimitrios_Sellountos_Project1)Zip the folder (.zip extension)Submit your zipped folder.
2 attachmentsSlide 1 of 2attachment_1attachment_1attachment_2attachment_2
Explanation & Answer:
User generated content is uploaded by users for the purposes of learning and should be used following Studypool’s honor code & terms of service.