Hi all,

I am having problems with the following part of the question:

The Letters of TRANSITION can be arranged to give different combinations of the word

a) count the amount of combinations where the N is only the first letter and not the last

- I am thinking that the final letter has 6 possible outcomes

- the remaining 8 slots are accounted for - but my sticking point is if "I" or "T" is in the last spot - how to eliminate over-counting them

b) N is neither the first or last letter

Thank you in advance for any feedback