please draw these paths by hand

1. Search Mario (M) is trying to search for the princess in the castle (P) however there are many different paths that he can take. Bowser has told him how long (time) it will take him if he chooses to travel along any given path (denoted by the number on the line) and has also offered him a heuristic value for each node (located in parenthesis) a. Using depth first search algorithm, draw the search tree and list the path he should take to find the princess. Also write the actual path length b. Using the hill-climbing algorithm, draw the search tree and list the path he should take to find the princess. c. Using A* search, draw the search tree and determine the path he should take to find the princess