SOLUTION
Given the question in the image, the following is the solution to the problem
Step 1: Scheduling n performers is found by n! ways...so five performers gives 5! The different number of ways for 5 performers therefore mean:

Hence, there are 120 different ways of scheduling these appearances.