Can someone take a look at my answers to these questions? I'm primarily concerned with my second answer. I believe these answers to be correct but am wondering if this is the most elegant approach or if there may be another approach one would use.
This problem concerns lists made from the symbols $A,B,C,D,E,F,G,H,I$.
(a) How many length-$5$ lists can be made if repetition is not allowed and the list is in alphabetical order?
My answer:
$$9 \choose 5$$
Since this counts the number of unique $5$-element subsets we can form from a $9$ element set and each subset has one order.
(b) How many length-$5$ lists can be made if repetition is not allowed and the list is not in alphabetical order?
My answer:
$${9 \choose 5 }\cdot 5! - {9 \choose 5}$$
My thought here was we can select our $5$-element subsets from a $9$ element set in $9 \choose 5$ ways and permute those elements in $5!$ ways. But we must remove each ordering in which they are alphabetized (which from part (a) we know is $9 \choose 5$).