n numbers of boys and n numbers of girls were lined up in a message. This line is a boy, a girl but the rows of boys and girls will not change. For example, if it's time for Ahmet, Mehmet, Ali, Veli, Aye, Fatma, Asl, Nigar Ahmet, our turn will be Aye, Mehmet, Fatma, Ali, Asl, Veli, Nigar. From memory Without using additional fields (ie you cannot use a new array of given names array.) Your given word algorithm algorithms in the word Write down the pseudo code and explain how your algorithms work on the example given in the question. a) O (n2 ) brute force working while working b) if n equals a positive full power of 2 at O (nlgn) operation time running and Divide-Manage method