discrete math hw help

4. {a}. How many ways are there to rearrange [all of] the letters of SPIDERLIULN so that all of the consonants appear in alphabetical order [not neoessarily oonseo- utively]? {h}. How many ways are there to rearrange [all of} the letters of SPIDERMAN so that the word PRJI'IE appears together as a word somewhere? [c]. How many ways are there to rearrange {all of} the letters of SPIDERMAN that begin and end with a vowel? {cl}. How many ways are there to rearrange [all of} the letters of SPIDERMAN so that the three vowels appear consecutively