Given 10,8,6,7,9swap the above numbers such that finally you got 6,7,8,9,10so now reverse 109,7,6,8,10now reverse 98,6,7,9,107,6,8,9,106,7,8,9,10at this point 6 is ahead so no more reversing can be done so stop.To implement above algorithm which datastructure is better and why ?

• A. linked list. because we can swap elements easily
• B. arrays. because we can swap elements easily
• C. xor linked list. because there is no overhead of pointers and so memory is saved
• D. doubly linked list. because you can traverse back and forth