(without using another array) n boys and n girls are lined up in a row. This line is a boy, a girl but we want to change the order between boys and girls themselves. will not change. For example, if the first row is Ahmet, Mehmet, Ali, Veli, Ayse, Fatma, Asl, Nigar. Our turn will be Ahmet, Ayse, Mehmet, Fatma, Ali, Asl, Veli, Nigar. From memory Without using additional fields (i.e. you cannot use a new array other than the given name array) the desired result Design an algorithm with the method given below and obtaining the Write down the pseudo code and explain how your algorithms work on the example given in the question. a) (15 points) Brute force working at O (n2) process time b) (15 points) If the number n equals a positive full power of 2, it works at O (nlgn) operation time, and the Divide-Conquer method