Assume Q is a non-empty queue that contains a string (array of characters). S1 and S2 are two empty stacks. Using only stack and queue ADT functions, write a function that reorders the characters in the stack such a way that all the characters with even indices are placed after the characters with the odd indices. For example if queue contains the word manchester (m is the character in the front of the queue)=> after reordering the content of queue is acetrmnhse. java