Each demon has a rank and a position. Their position is indicated by their index in an array. Their rank is indicated by the value in that position in the array. For example, the array {6,2,5} indicated that there is a demon in position 0 with a rank of 6, a demon in position 1 with a rank of 2, and a demon in position 2 with a rank of 5. Write a method that "cycles down" and "demotes" all of the demons. Cycling down involves moving every demon down one in position, with the demon previously in position 0 going to the highest position. At the same time the demons are also getting demoted. That means their value goes down by one. So after cycling down and demoting, the array {6,2,5} becomes {1,4,5}. (The reason is that the 2 gets demoted to a 1 and cycled down to position 0. The 5 gets demoted to a 4 and cycled down to position 1. The 6 gets demoted to a 5 and moved to the highest position.) Look at the test data for examples!