Question $\backslash$#$4$

Consider the following grammar G :

S$\text{'}$n XYZ

Xn cd

Yn cK

K$\text{'}$n ZK$|\backslash (\backslash$varepsilon $\backslash )$

Z$\text{'}$n b

$($a$)$ Create a non$-$recursive predictive parsing table for grammar G$.$

$($b$)$ Is the above grammar ambiguous or not? Justify your answer.

$($c$)$ Empty Cells in the table represent what?