Find the number of ways all 9 letters of the word EVERGREEN can be arranged if (i) there are no restrictions, (ii) the first let
ter is R and the last letter is G, (iii) the Es are all together. Three letters from the 9 letters of the word EVERGREEN are selected. (iv) Find the number of selections which contain no Es and exactly 1 R. (v) Find the number of selections which contain no Es.
