Find the number of permutations of the letters of the word SUCCESSFULLY if: $[$A $-5,$ C $-5]$

a$)$ The letters may be in any order $($no restrictions$).$

b$)$ The last letter must be $L_{{?}_{?}}.$

c$)$ The first letter must be a vowel $(U_{?}$ or $E.$