Using the arrangements formula, it is found that there are 12 ways for the dragons to go on stage.
The number of possible arrangements of n elements is given by the factorial of n, that is:
[tex]A_n = n![/tex]
In this problem, we have that:
Hence the number of ways by which they can go on stage is:
N = 2 x 3! = 12.
More can be learned about the arrangements formula at https://brainly.com/question/24648661
#SPJ1