Minimax Algorithm with Alpha-beta pruning

It is your turn to do some of the alpha-beta pruning. The tree below indicates the complete Minimax tree for a particular problem (first move by MIN, then MAX, and then MIN again – notice that is different from our previous examples, where MAX started). The number at each leaf p indicates the value of the static evaluation function e(p) if it were computed at that leaf.a) Now your job is to check the boxes under those leaves that do not need to be created and evaluated thanks to the alpha-beta p