EVERGREEN $\Rightarrow \big[\text{E repeated 4 times }\big],\big[\text{R repeated 2 times }\big],\big[\text{V repeated 1 times }\big],\big[\text{G repeated 1 times }\big],\big[\text{N repeated 1 times }\big]$
$\color{violet}{\text{Now, the question is How many strings with seven or more characters can be formed}}$
$\color{violet}{\text{ from the letters of the word}}$ $\color{red}{'EVERGREEN'}$
$\color{blue}{\text{1. Seven letter string :}}$
- $\color{chocolate}{\text{Forming word except the letter}}$ $\color{maroon}{\{V,G\}}\rightarrow \color{red}{ EEEERRN}$ or $\color{maroon}{\{G,N\}} \rightarrow \color{red}{EEEERRV}$ or $\color{maroon}{\{V,N\}} \rightarrow \color{red}{EEEERRG}$
$\text{Number of ways will be}$ $\Bigg[\dfrac{7!}{4!\times 2!} + \dfrac{7!}{4!\times 2!} + \dfrac{7!}{4!\times 2!}\Bigg] = 3 \times \dfrac{7!}{4!\times 2!} = 3 \times 105 = 315 $
- $\color{chocolate}{\text{Forming word except the letter}}$ $\color{maroon}{\{1R,G\}}\rightarrow \color{red}{EEEERVN}$ or $\color{maroon}{\{1R,V\}}\rightarrow \color{red}{EEEERGN}$ or $\color{maroon}{\{1R,N\}}\rightarrow \color{red}{EEEERVN}$
$\text{ Number of ways will be}$ $\Bigg[\dfrac{7!}{4!} + \dfrac{7!}{4} + \dfrac{7!}{4}\Bigg] = 3 \times \dfrac{7!}{4} = 3 \times 210 = 630$
- $\color{chocolate}{\text{Forming word except the letter}}$ $\color{maroon}{\{1E,V\}}\rightarrow \color{red}{EEERRGN}$ or $\color{maroon}{\{1E,G\}}\rightarrow \color{red}{EEERRVN}$ or $\color{maroon}{\{1E,N\}}\rightarrow \color{red}{EEERRVG}$
$\text{Number of ways will be}$ $\Bigg[\dfrac{7!}{2!\times 3!} + \dfrac{7!}{2!\times 3!} + \dfrac{7!}{2!\times 3!}\Bigg] = 3 \times \dfrac{7!}{2!\times 3!} = 3 \times 420 = 1260 $
- $\color{chocolate}{\text{Forming word except the letter}}$ $\color{maroon}{\{1E,1R\}}\rightarrow \color{red}{EEERVGN}$
$\text{Number of ways will be}$ $\Bigg[\dfrac{7!}{3!}\Bigg]= 840 $
- $\color{chocolate}{\text{Forming word except 2 R's}}\rightarrow \color{red}{EEEEVGN}$
$\text{Number of ways will be}$ $\Bigg[\dfrac{7!}{4!}\Bigg]= 210$
- $\color{chocolate}{\text{Forming word except 2 E's}}\rightarrow \color{red}{EERRVGN}$
$\text{Number of ways will be}$ $\Bigg[\dfrac{7!}{2! \times 2!}\Bigg]= 1260 $
$\color{green}{\text{Total Number of ways of forming 7 letter word =}}$ $(315+630+1260+840+210+1260) = \color{lightblue}{4515}$
2. $\color{blue}{\text{Eight letter string :}}$
- $\color{chocolate}{\text{Forming word except 1 R}}\rightarrow \color{red}{EEEERVGN}$
$\text{Number of ways will be}$ $\Bigg[\dfrac{8!}{4!}\Bigg]= 1680 $
- $\color{chocolate}{\text{Forming word except 1 E}}\rightarrow \color{red}{EEERRVGN}$
$\text{Number of ways will be}$ $\Bigg[\dfrac{8!}{3! \times 2!}\Bigg]= 3360$
- $\color{chocolate}{\text{Forming word except}}$ $\color{maroon}{V} \rightarrow \color{red}{EEEERRGN}$ or $\color{maroon}{G} \rightarrow \color{red}{EEEERRVN}$ or $\color{maroon}{N} \rightarrow \color{red}{EEEERRVG}$
$\text{Number of ways will be}$ $\Bigg[\dfrac{8!}{4! \times 2!} + \dfrac{8!}{4! \times 2!} + \dfrac{8!}{4! \times 2!}\Bigg] =3 \times \dfrac{8!}{4! \times 2!} = 3 \times 840 = 2520 $
$\color{green}{\text{Total Number of ways of forming 8 letter word =}}$ $(1680+3360+2520) = \color{lightblue}{7560}$
3. $\color{blue}{\text{Nine letter word :}}$
$\qquad\color{green}{\text{Number of ways will be}}$ $\Bigg[\dfrac{9!}{4! \times 2!}\Bigg]= \color{lightblue}{7560} $
∴ $\color{orange}{\text{Total number of ways = }}$ $(4515 + 7560 + 7560) =$$\color{purple}{19635}$