Preferably JAVA please help me

Implement any one uninformed search method and any one informed (heuristic-based) search method in a programming language of their choice such as C or Java. The search methods are listed below in the two different categories. Please note that you must implement at least one between Uniform Cost & A* since they involve the most computation.

Principles of Artificial Intelligence Assignment 1 - Implementation of Search Methods This lab assignment focuses on search methods in Al. Students are required to work in teams of two and implement any one uninformed search method and any one informed (heuristic-based) search method in a programming language of their choice such as C or Java. The search methods are listed below in the two different categories. Please note that you must implement at least one between Uniform Cost & A" since they involve the most computation. Uninformed Search Methods Depth First Search Breadth First Search Depth Limited Search Uniform Cost Search (Branch and Bound) Informed Search Methods Greedy Search (Best First) A Search Hill Climbing Search (Gradient Descent) You can implement the search methods in the context of any other application, e.g., GPS, traveling salesperson, finding parking etc. The program requirements are as follows. Input: Start State, Intermediate States, Goal Test, Path Cost for both informed and uninformed methods, Search Heuristic for informed methods. Processing: Any one uniformed and any one informed search method to go from the start state to the goal state. Output: Path(s) traced from start state to goal state, Total path cost. It is not required to develop a GUI in the program, it is sufficient to show the paths by listing the states from start to goal as a program output. In your presentation, you must draw the search map for the problem and the search trees for each method as diagrams in addition to that. Principles of Artificial Intelligence Assignment 1 - Implementation of Search Methods This lab assignment focuses on search methods in Al. Students are required to work in teams of two and implement any one uninformed search method and any one informed (heuristic-based) search method in a programming language of their choice such as C or Java. The search methods are listed below in the two different categories. Please note that you must implement at least one between Uniform Cost & A" since they involve the most computation. Uninformed Search Methods Depth First Search Breadth First Search Depth Limited Search Uniform Cost Search (Branch and Bound) Informed Search Methods Greedy Search (Best First) A Search Hill Climbing Search (Gradient Descent) You can implement the search methods in the context of any other application, e.g., GPS, traveling salesperson, finding parking etc. The program requirements are as follows. Input: Start State, Intermediate States, Goal Test, Path Cost for both informed and uninformed methods, Search Heuristic for informed methods. Processing: Any one uniformed and any one informed search method to go from the start state to the goal state. Output: Path(s) traced from start state to goal state, Total path cost. It is not required to develop a GUI in the program, it is sufficient to show the paths by listing the states from start to goal as a program output. In your presentation, you must draw the search map for the problem and the search trees for each method as diagrams in addition to that