'Suppose your team in Valorant has N players; each with the ability Ai. In one move, You can break the formation ofthe team in the form of suffix of any length of the array and attach it to the front: You can do the move as many times as you like_ Develop a C++ code to find ifthe array can be sorted non-decreasingly, if yes then output "Attack" and the minimum number of moves required. Otherwise, print "Defend"_ Sample Input:
2 1 3
Sample Output: Defend'