Hi, I am studying Artificial intelligence and I'm struggling with my assignment can someone help me please, it is in the Advirsial search chapter in MiniMax.

Q3. Games. Consider the following game tree in which the heuristic scores in parentheses at the leaf nodesare all from MAX player. 1. Which move the second player (MIN) choose if the first player moves from A to B? 2- What nodes would not need to be examined (using the alpha beta algorithm). MAX A MIN B D E F F H J K 4 8 5 3 3- As alpha beta algorithm is a DFS procedure using alpha and beta cuts, expanding node A leads to three nodes B, C, and D. Suggest an order of exploring those nodes of the tree in order to minimize the size of the searching tree