Ouestion $4.[20$ pts$]$

Imagine you have a deque $D$ containing the characters of the string "algorithm" in order. Additionally,

assume you have an initially empty stack $S.$

Note: You are required to perform a series of operations that result in $D$ storing a rearranged order of the

characters.

a$)[10$ pts$]$ Write a code fragment that uses only $D$ and $S($and no other variables$)$ that results in $D$

storing the characters in the order "Ihogmirta". Describe each step of your code fragment.

b$)[10$ pts$]$ Repeat the previous problem using the deque $D$ and two initially empty queues, Q$1$ and

Q$2.$ Aim to achieve the same final arrangement in D$.$ all the codes should be written in java