Given a sorted array of N+2 integers between 0 and N with exactly one duplicate, design a logarithmic time algorithm to find the duplicate. Note: you don't need to write a code. Just use your English words to describe the algorithm

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…

Use Java language and the last digit of ID is a 7

CAN THIS PLEASE BE DONE In PYTHON? Input a list of employee names and salaries and store them in parallel arrays.  End the input with a sentinel value. The salaries should be floating point numbers  Salaries should be input in even hundreds.  For example, a salary of 36,510 should be input as 36.5 and a salary of 69,030 should be entered as 69.0. Find the average of all the salaries of the employees.  Then find the names and salaries of any employee who's salary is within 5,000 of the average.  So if the average is 30,000 and an employee earns 33,000, his/her name would be found.  Display the following using proper labels.    Save your file using the naming format  LASTNAME_FIRSTNAME_M08 FE.  Turn in your file by clicking on the Start Here button in the upper right corner of your screen.     1.Display the names and salaries of all the employees.  2. Display the average of all the salaries 3. Display all employees that are within 5,000 range of the average.

You are going to write a MIPS program that does the following (there is C++ sample code below to explain the logic): • Create an array of 23 INTEGERS, you can put whatever you want in it, but they shouldn’t be sorted. Without using recursion: • Create a procedure to find the largest called findLargest • Create a procedure to find the smallest called findSmallest. • Create procedure called range, which is the difference between largest and smallest (range should call findLargest and findSmallest) • Create a recursive procedure to find the largest (call it findLargestRecursive)

help in pytyhon