Answer: 120 different combinations .
Step-by-step explanation:
The combination of n things taking m things at a time is given by :-
[tex]C(n,m)=\dfrac{n!}{m!(n-m)!}[/tex]
Given : The total numbers of errands = 6
Now, the combination of 6 errands taking 3 at a time is given by :-
[tex]C(6,3)=\dfrac{6!}{3!(6-3)!}\\\\=\dfrac{6\times5\times4\times3!}{3!}=120[/tex]
Hence, he could choose to run 120 different combinations of three errands .