(i)[1]
there are no restrictions are imposed,
(ii)[2]
the first letter is R and the last letter is G,
(iii)[2]
the Es are all together.
(iv)[1]
Three letters from the 9 letters of the word EVERGREEN are selected. Determine the number of selections that contain no Es and exactly $1$ R.
(v)[3]
Find the number of selections with no Es.