with some working if possible please

. . Perform the alpha-beta pruning algorithm on the following tree, searching left before right: Record to the left of a node the alpha and beta values upon first visiting the node. Record under a node the alpha and beta values after visiting the left child of the node. Record to the right of a node the alpha and beta values upon visiting both children. Circle any nodes (including leaves) that are not visited. Alpha and beta values need not be written for unvisited nodes nor for leaf nodes. Write in the game-theoretic value of the root node in the circle. Draw arrows along the path that would be taken if both players made optimal decisions. 2 1 B MAX BE 11 Be 2 10 12 B- BE MIN 20 B- B- 6 B 16 B 9 7 13 B 15 17 3 B- 19 MAX B B B B- 4 8 14 Bar 18 B 18 Be 3 5 2 4 7 8