Please I need help with the question below. Draw the Finite Automata instead of using text if possible. Thank you.

The set of strings that represents the Name plates of the cars in Egypt

includes the strings that consists of two parts; the first part consists of

one or two or three alphabets, while the second part consists of one or

two or three digits. $($e$.$g$.$ AB$345,$ GDS$123,$ F$56,...$etc.$)$ digit,

alphabet $\}$

a$.$ Design an NFA with ${?}^{?}-$moves that recognizes this set of name

plates, and mention its formal description

b$.$ Is the string AUC$2024$ a valid name plate in Egypt? Justify your

answer with a sequence of transitions and explain why?

c$.$ Convert the NFA to an NFA without ${?}^{-}$ moves and mention its

formal description.

d$.$ Convert the new NFA into a DFA and mention its formal

description.