Can someone help with the python code for the A* Search of an example of how it is done.

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. Please note that you must implement at least one between Uniform Cost and A* since they involve the most computation. 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 follow the traveling salesperson example studied in class as the domain for the search problem. Alternatively, 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. . 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. You must present your assignment in class using slides and demo and upload the same slides online, one per person, i.e INDIVIDUALLY. Slides must include: Explanation of your search Problem, Path Cost