Implement any one uninformed (deterministic) search method and any one informed (heuristic-based / stochastic) search method in any programming language, e.g., C, Java etc. The search methods are listed below in the two different categories.

Uninformed / Deterministic Search Methods

• Depth First Search
• Breadth First Search
• Depth Limited Search
• Uniform Cost Search (Branch and Bound)

Informed / Stochastic Search Methods (with heuristics)

• 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., building a GPS, finding parking, searching for a web page 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.

Also explain:

• Search Problem
• Path Cost and Heuristics
• Search Map with and without heuristics
• Search Tree for each method
• Relevant Parts of Source Code for the Searches
• Demo of Searches live

Any program language can be used. Please include the code when answering. Thanks!