For the game tree given below:

Show how you can apply Shallow & Deep Prunning to find the best winning strategy (notice that there are values for the paths).

From left to right, the heuristic (h) values are given below:

For the first row: h = 17

For the second row: h = 12, h = 15, h = 20

For the third row: h = 10, h = 11, h = 12, h = 11, h = 14, h = 15, h = 11

For the fourth row: h = 7, h = 5, h = 8, h = 9, h is blank, h = 2, h = 7, h = 8, h = 9, h = 8, h = 7, h is blank, h = 9

For the last row: these are terminal values. The terminal values are 14, 17, 11, 18, 9, 14, 17, 6, 11, 19, 20, 27, 22, 19, 17, 16, 12, 21, 27, 21, 19, 12, 11, 17, 25, 13

Q2 For the For the game tree given bellw: - explain the concept of shallow s deep prunning capply this concept to d the show how you can best Winning streategy offind h=17 s 2 h=12 h=20 4:15 3 2 4 3 h 11 h-11 h:12 h=14 | h:15 hero h:11 4 3 1 2 5 6 4 3 2 2 h:7 12 hez 2:9 h=9 hsz 26:2 Shar 10 o o o O 27 22 00 16 12 21 too 27 2 19 Aiz 25 13 17 6 OL 19 14 17 1 18 9 14