N$.$B: Question is related to compiler design Contruct the predictive parser for the following grammar

$[$ S $->$ a$||($T$)$; T $->$ T$,$ S $|$ S $]$

a$)$ write the leftmost ferivaation for sentance

b$)$ wirte the rightmost derivation for the sentence

c$)$ write the handle of each step in the normal reductioin of sentence