HANDWRITTEN SOLUTION NEEDED Consider the empty NFA given below:

$\backslash$table$[[$STATES$,0,1,$epsilon$],[$A$,$B$,$ C$,$A$,$B$],[$B$,-,$B$,$C$],[$C$,$C$,$C$,-]]$

a$)$ Calculate empty closures. $[3$ Marks$]$

b$)$ Convert it to NFA without empty moves. $[6$ Marks$]$

c$)$ Convert it to DFA. $[6$ Marks$]$