Start of by stating, we regard the letters as distinguishable. If it were probability then you would say, to produce equally likely outcomes. But this is beyond the level at school.
So we have 1W,8O,3L,1M, such that all the O's,L's are different. You can introduce subscript etc.
i) If no O's are chosen we need to remove the 8O's from our total letters. We can now select any 4 letters from the total 5, in 5C4=10 ways
ii) Similar to above our total letters now consist only of the 8O's. We can select any 4O's from the 8 in 8C4=70 ways
iii) Now there is one possible selection for the 3L's i.e. L1L2L3. This can be done in 3C3=1 ways. We can then select 3 more letters from any of the 10 remaining letters in 10C1 ways. We can then put these two answers together by the multiplication rule (since if we selected the non-L first this would've have changed our ability to select the L's) in 3C3 x 10C1 = 10 ways
iv) So we can do this two ways, we can look at the cases for <=1O or do a subtraction from the total unrestricted selection with the cases for O>=2
Method 1: O<=1
If we want no O's this is just our answer from (a) i.e. 5C4
If we want 1O, we can select any of the O's from the total 8 in 8C1 ways. We can then select any 3 letters from the non-O's in 5C3 ways.. Putting this together with multiplication rule we get 8C1 x 5C3
Thus the total is 5C4+8C1 x 5C3=85
Method 2: If we can select 4 letters from any of the 13, we can do thuis in 13C4 ways
If we want 2O's, we can select them in 8C2 ways and then the non-O's in 5C2 ways, =8C2 x 5C2
If we want 3O's, we can select them in 8C3 ways and then the non-O's in 5C1 ways, =8C3 x 5C1
If we want 4O's, we can select them in 8C4 ways and we dont select any non-O's
Required answer = 13C4-(8C2 x 5C2+8C3 x 5C1+8C4)=85
v) There is a kinda trick to this sort of question, you can do case by case but it is much easier to simply satisfy the initial condition and then go from there.
We need at least one L to be chosen, we can select this L in 3C1 ways. We can then take an unrestricted selection of 3 letters from the remaining 12 letters, since regardless of the outcome we satisfy the initial condition i.e. L LLL or even L OOO etc. This can be done in 12C3 ways.
Thus the required answer is 3C1 x 12C3=660
Yeah if you do by cases, you can do it in a similar way to (iv) but you have to be careful of double counting
vi)
This can be done by cases
Case 1: 2L | 20, the 2 O's can be selected from any of the 8 O's in 8C2 ways
Case 2: 2L | 1O,1L the 1O can be selected from any of the 8 O's in 8C2 ways and the 1 L in 1C1 ways, so 8C2 x 1C1 =8C2
Case 3: 3L | 1O ... 8C1
Case 4: 3L | 1L but this is not valid since no O would be selected
Thus the required answer =8C2+8C1+8C1=44
Hope this helps. Feel free to ask any q