Counting Product Rule

If a procedure can be broken down into a sequence of $m$ tasks where there is:

• $n_1$ ways to do the first task
• $n_2$ ways to do the second task
• …
• $m$ ways to do the $m$th task
• Then there are $n_1\ast n_2\ast \cdots \ast m$ ways to do the procedure