$1.$ Come up with an example and programmatically implement any uninformed search algorithm. If you have hard time selecting an example, you are welcome to use the Romania traveling example from the class and the book. Please go from a graph to a tree and then try to write a program in any language to show how to get from the start state to a goal state. If your program is not complete, it is OK$.$ Just submit bits and pieces with comments. We are learning and the process is more important than the result.

$2.$ Please write a code implementing A$*$ search. Again, if your code is incomplete, it is OK$.$