C++ Recursive Function

Program 1: You are to create a recursive arraY Ve Eunction to perform a linear search through an How Program Works o Program has size of array o Load values into the Index o Pass array, key and size to the recur o User enters key t of 5000 etc array. Index 0 has value o, index 1 has value 1, methodStatus) arsearch(int array Il,int key, int size, bool & us is true), print out the key and number of the main for, recursive function calls itself until the key is found (methodstatus Pr function calls when control is returned to o search daeion of key not found (return number of function methodstatus of false) - print not found message and calls AND number of calls in the main o Function returns a count of how many recursive calls were made that o Value returned is the number of calls made to that poine item is found the value returned is 1 with preceding functions adding recursive function calls are counted). 1 to the return value until the actual number of Does the stack-overflow occur? Can you change the size of the array to make that happen or change the size so it does not happen? Be sure to include screen shots of biggest possible valid s found" plus a screen shot of stack overflow condition. earch and "not