Hi I am stuck on this problems

Given a game as above, edge labels are used to represent different actions. If alpha-beta pruning algorithm is used, then what actions won't be taken by agent or opponent? (Another way of pruning, in the lecture, when we discuss the algorithm, we often say nodes would be pruned, which is equally to saying the actions won't be taken ) a. B4,A4,A5,B5,A6,A7 b. B4,A4,A5 c. B5,A6,A7 d. B6, B7