t for several problems you will modify some provided Python code to implement algorithms to solve the same instance of the knapsack problem. After implementing all of the code and solving the problem, you must provide a single table of all results similar to the following: Table 1: Example of results summary (numbers are not realistic) Algorithm Local Search (Best Improvement) 200 Local Search with Random Restarts (k = 100) Local Search with Random walk (p=0.25) etc. Iterations #Items Selected Weight Objective 3102 9510 2102 49 97 117 121 21 147 87 32 184 Knapsack Problem Definition Given n different items, where each item i has an assigned value (v.) and weight (w), select a combination of the items to maximize the total value without exceeding the weight limitations, W, of the knapsack.

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…

The following code is implementing a Treasure map use the A* algorithm to find the shortest path between two points in a map.  It appears that the initial compare looks at the f_cost and decides that we are at the point in the map and exits the routine and prints only the starting point.  I'm not sure how to fix it, any help would get appreciated.  Example of the output from the following Python program: start place = (0, 0) Treasure location: (29, 86)  Path to treasure:(0, 0) Python Code: import heapqimport random class Tile:    def __init__(self, x, y):        self.x = x        self.y = y        self.is_obstacle = False        self.g_cost = 0        self.h_cost = 0        self.f_cost = 0        self.parent = None     # Define comparison methods for Tile objects based on their f_cost    def __lt__(self, other):        return self.f_cost < other.f_cost     def __eq__(self, other):        return self.f_cost == other.f_cost class Map:    def __init__(self, width, height):…

help in pytyhon

JAVA: Which is/are correct statement(s) about the Recursion? (Select all that apply) We can use for loop and while loop in recursion. We solve a problem that depends on solving smaller occurrences of the same problem. We have high performance while using recursion rather than iteration. We have high performance while using iteration rather than recursion. Easy to implement the algorithm while using recursion but hard to find the time complexity. Easy to implement the algorithm while using iteration but hard to find the time complexity. Base case is a simple occurrence that cannot be answered directly. Recursive case is a more complex occurrence of the problem that cannot be directly answered, but can instead be described in terms of smaller occurrences of the same problem. We must have exact one base case and one recursive case. We must have at least one base case. We must have at least one recursive case.