If a dice is to be rolled until all sides have appeared at least once, find the expected number of times that outcome 1 appears. (remark: let n be the number of rolls until all sides have appeared. computing e[n] is what is called a coupon-collecting problem; see section 7.2 in the textbook.)

step-by-step explanation:

1. practice, practice & more practice

2. review errors

3. master the key concepts

do not try to memorise the processes.

4. understand your doubts.

5. create a distraction free study environment

6. create a mathematical dictionary

7. apply maths to real world problems.

answer: b f g .

step-by-step explanation: