Answer:
1. 120 ways
2. 720 ways
Step-by-step explanation:
When the order is important, we have a permutation.
When the order is not important, we have a combination.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:

Combinations formula:
is the number of different combinations of x objects from a set of n elements, given by the following formula.

1. If the jobs are all the same.
Same jobs means that the order is not important. So
3 from a set of 10.

120 ways
2. If the jobs are all different.
DIfferent jobs means that the order matters.

720 ways