: ASU Is moving to Canvas. Click to learn more lackboard Home Courses OrganizationsHelp Shown below are the Stack and Queue UML class diagrams, where we assume that each node in DList stores an Integer, so we can have a Stack or Queue object where each element is an Integer ist Stack mlist:Duist + Stack(): ctor" + clearO: void + isEmpty) boolean +peek: Integer +pop): Integer +pushlpD ata Integer): void +toStringt String wov erride #getListODList #setList(plist DList): void mlist: DList Queue) "ctor + clearD void dequeue: Integer + enqueuelpData: Integer +isEmpty): boolean void integernav erride +toStringx String woverride* agetListO: OList setlist(pList. Dust) Suppose we have declared a Stack object named stack and we have pushed the Integers 7, 3, 5, 11, and 9 onto stack in that order The contents of stack is now (9, 11, 5, 3, 7) where 9 is the item on top of stack We wish to augment the Stack class with a new method public void reverse0 that when called on stack will modify stack so that after the method returns, the contents of stack will be reversed, ie, for the example, stack will be (7,3, 5, 11, 9) after returning from stack.reverse). Complete the code below which implements reverse). public class Stack i public void reverset)