PROVE THE FOLLOWING (A-C PLEASE!!!) a) (2 pts) Breadth-first search is a special case of uniform-cost search. Hint: Since uniform- cost search orders fringe nodes by g(n) values (i.e., sum of step-costs so far), how would you set the step costs to make it behave like breadth-first search?

b) (2+2+2 pts) Breadth-first search, depth-first search, and uniform-cost search are all special cases of best-first search. Hint: Since best-first search orders fringe nodes by f(n) values, how would you set f(n) for each of the 3 cases?

c) (2 pts) Uniform-cost search is a special case of A* search.