WRITE A prolong PROGRAM for the example on slide 17..program for breadth first algorithm BFS,AND one program for depth first algorithm DFS,and one program for A* ordered algorithms ,and A NEW heuristic search ALGORITHM OF YOUR CHOICE.

YOU HAVE TO CONSTRUCT A HEURISTIC FUNCTION OF YOUR CHOIC

16 Naruto - 2014 164 HA 6 X . lis 12 113 76 04 2 83 -INU G 17 2.00 GS 17 71 G3 5 HU 44 DI tu S 6 31 28-3 . 161 7200 2 U1 21 2G 83 28 17 GGS 175 17 17 1 2 3 1 2 3 S181 EOS NOS Coal node FIG. The tree produced by a depth-first search