JAVA StacksData Scructures IStackImplementarionCreate a class called ArrayBasedStack. Declare the follkawingvariahles:* data references an array scoring elements in the istmpOStack. an inr value represenring the location nf the stackTop in the array• INITIAL, (CAPACITY the defalt capaciey of the srackpuhlic clans AayRasedSeack {private SinglyLinkedNode top Node = null;Data Structures StacksThe pop method willemove ihe last clenca hat was added totle stackpubile I popo• li seack is enpty tlauw at EuptyStackException. Iuport theEmpeyStackExccption class whichis in tle javautd packageif lisEmpaydoData Suructures StacksDuta Stractures Stack dStack undkrlowthrow new ErptyStackEeptioan.• lf there are ekments. get the ckment at the end af che sack(index is topOtStack) aad decrementthe indea of the tup af the stack. Set the previous tog of cheSzack su aulE returOy - dataidataltopOtScack) - null;• Decrernene the index of the op n the seack and rerurn cheprevious cop.top(tStack,Data Structures I Stack 8public void push(E newElement) {// create a node that holds the new element// set the next node reference of the new node to the current topIl set the top node to reference the new elementpublic boolean isEmpty0 {i cmpty if the topNode is nullreturnRun the tollowiag in iateractions witha viewer open on thevark object. Anvwer the follewing questionsand then use the viewer co verity your answers.- What wilthe srack look likke after ievolcing rhe pash operarionpublic E pop0 {ii throw an exception if stack is empty/i store data from current top node (type E)Il set the top node to reference the next node in the stackIl return the stored dataon String objects "ist. "and", and• What would a nop operation rerurn ar this poinr? Whar woalda second pop operation rerum?ArrayBasedStack stack - new AmayliasedStack(gktack inllonprasetacahEniestack puslt'isa'kstack islipryopublic E peck0 {li throw an exception if stack is empty// return the data from the top nodefalsestark pash and'kstack panht" sed'kStack pop0stack pop02ndSack pusht"4ih",stack pop0Submit both the ArrayBasedStack class and the LinkedStackclass implementationsstack pop0stack isEmptyo

following a Le the viewer to verify your anrers Mack pushl JAVA Stacks Dara Screctures IStack Implementarion Create a class ealled ArravilasedStack. Declare the folkowing variahles * data references an array scoring elements in the ist mpOStack. an inr value represenring the location of the stack true If you had used a linked list implementation of the stack, how would your stack differ from the array implementation? Add a method called peek that will return the top of the stack but will not remove the element from the TANmp ia the array • INITIAL, CAPACITY: the defalt capaciry of the stack pahlic elass AmaylasedStack { private SinglyLinkedNode top Node = null; Data Structures Stacks Duta Structures Stack e ASack undrlow thruw nev EeptyStackEeption. •If there are ekments, get the ckent at the end of che sack index is top(Stack) and decrement Lhe indea of the Lup af the stack. Set the previous tog uf cde Data Structures I Stack 8 public void push(E newElement) { I/ create a node that holds the new element Stack sa nul EreturnObj - latal ; dataſtopOtscack) - aul; • Decrernene the index of rhe op the seack and reeurn ehe previous cop. ropOtStack , Il set the next node reference of the new node to the current top l set the top node to reference the new clement public boolean isEmpty0 { l empty if the topNode is null return : Run the tollowing in interactions with a viewer open on the rark objert. Anvwer the follesing questions and then use the viewer to verity your answers. - What wil the srack look like after involcing the pash operarion on String objects "ist, "and, and "znd? • What would a nop operarion return ar this poinr? Whar woald 1 second pop operation rerum? ArrayBasedStack stack - new AmayliasedStacjk stack isliapry public E pop0 { ii throw an exception if stack is empty /i store data from current top node (type E) Il set the top node to reference the next node in the stack / return the stored data Enie stack pusl'isa'k public E peek0 { Il throw an exception if stack is empty // return the data from the top node stack isEnapry0 false Tase szark pash'and'k Stack pasht" sed"h stack pop0 stack pop0 and Sack pushl"4ih stack pop0 Submit both the ArrayBasedStack class and the LinkedStack class implementations stack pop0 stack isEmptyo