i need the full answer with drawing and put the data on the drawing

Given the game search tree, answer the following questions by using alpha-beta algorithms: 1) Determine the optimal move for the current player at the root of the tree (MAX)? 2) What nodes will be pruned using alpha-beta algorithm. 3) How does the alpha-beta algorithm differ in terms of time and space complexity compared to the Min-Max algorithm? Assume that, when given a choice, the Alpha-Beta search expands nodes in left-to-right order