Consider the following requirements to make a secure password:

Digits $=\{0,1,2,3,4,5,6,7,8,9\}$

Lower Case $=\{$a$,$ b$,$ c$,$ d$,$ e$,$ f$,$ g$,$ h$,$ i$,$ j$,$ k$,$ l$,$ m$,$ n$,$ o$,$ p$,$ q$,$ r$,$ s$,$ t$,$ u$,$ v$,$ w$,$ x$,$ y$,$ z$\}$

Upper Case $=\{$A$,$ B$,$ C$,$ D$,$ E$,$ F$,$ G$,$ H$,$ I, J$,$ K$,$ L$,$ M$,$ N$,$ O$,$ P$,$ Q$,$ R$,$ S$,$ T$,$ U$,$ V$,$ W$,$ X$,$ Y$,$ Z$\}$

Special Characters $=\{!,$ $$,$ #$,$ &$\}$

Compute the number of passwords you can make with the following constraints.

$($a$)$ Strings of length $=2.$ It can include anything from the four groups with no repeated characters.

$($b$)$ Strings of length $=2$ but the first character cannot be a special character.