$4.[10$ Marks$]$

a$)$ Explain the minimax algorithm used for decision$-$making in such games. How does it ensure that a player makes the best possible move assuming the opponent also plays optimally? $[3$ Marks$]$

b$)$ Describe the alpha$-$beta pruning technique. How does it improve the efficiency of the minimax algorithm? $[3$ Marks$]$

c$)$ Explain how alpha$-$beta pruning can be incorporated into the minimax algorithm using pseudocode. $[4$ Marks$]$