Need help with this c++ problem Use recursion to implement a function: find(s, t) that tests whether the string t is contained in the string s. For instance, calling the function like this: find("Mississippi", "sip") returns true. You must use recursion to complete this, not loops; you obviously may not use the string find() member function either. Here's the basic strategy: • If the text starts with the string you want to match, then you are done. • If the string s is smaller than the string t, you are also done. • If not, check the sentence without the first character.

Please use C++ and make sure it's for a sorted array Write a function, remove, that takes three parameters: an array of integers,the number of elements in the array, and an integer (say, removeItem). Thefunction should find and delete the first occurrence of removeItem in thearray. If the value does not exist or the array is empty, output an appropriatemessage. (Note that after deleting the element, the number of elements inthe array is reduced by 1.) Assume that the array is sorted.

Please answer quick in python

I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # #   ## # # #### #     ## ##### ##       ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…