$,$ answer the following questions:

Figure $1$:

$($a$)$ What is the start state?

$($b$)$ What is the set of accept states?

$($c$)$ What sequence of states does the machine go through on input aabb $?$

$($d$)$ Does the machine accept the string aabb $?$

$($c$)$ Does the machine accept the string $lon?$

$($f$)$ Further, give the formal description of the DFA.