Consider the switch statement in C$-$like languages, defined here according to this grammar:

$1.$ P $->$ Switch $$

$2.$ Switch $->$ switch $($ expr $)\{$ Cases Default $\}$

$3.$ Cases $->$ Cases Case

$4.$ Cases $->\backslash$epsi

$5.$ Case $->$ case const: Stmt

$6.$ Stmt $->$ stmt; break;

$7.$ Stmt $->$ stmt;

$8.$ Stmt $->\backslash$epsi

$9.$ Default $->$ default: stmt;

$10.$ Default $->\backslash$epsi

$($a$)(2$pt$)$ Compute the sets first$($X$)$ and follow$($X$),$ for all non$-$terminals X$,$ and the sets

predict$($p$)$ for all production rules p$.$