Consider the following nodes with successors and costs as shown: 2 A B 7 2 3 L F D E 5 4 2 K M 1 J 1 start H 4 3 P Suppose that B and K are goal nodes and that H is the start node. The actual cost of going from one node to another is given by the numbers on each arc. Suppose that the estimated cost of the path from A to a goal is 1, from C is 3, from D is 7, from E is 4, from F is 2, from H is 11, from I is 3, from J is 4, from L is 4, from M is 13, and from P is 2. (a) List the nodes in the order they would be expanded using best first search. (b) List the nodes in the order they would be expanded using uniform cost search. (c) List the nodes in the order they would be expanded using algorithm A search. (Algorithm A is the same as A*, except that we haven't shown that the heuristic is admissible/consistent.) (d) Is algorithm A an A* search in this case? If so, informally prove it. Otherwise, give a counterexample showing it is not an A* search