alice has three array-based stacksaband csuch that has capacity has capacity and has capacity initiallya is fulland and are empty unfortunatelythe person who programmed the class for these stacks made the push and pop methods private the only method alice can use is static methodtransfer( , )which transfers (by itera-tively applying the private pop and push methodselements from stack to stack until either becomes empty or becomes full sofor examplestarting from our initial configuration and performing transfer(acresults in now holding elements and holding describe sequence of transfer operations that starts from the initial configuration and results in holding elements at the end - alice has two queuess and twhich can store integers bob gives alice odd integers and even integers and insists that she stores all integers in and they then play game where bob picks or at random and then applies the round-robin schedulerdescribed in the to the chosen queue random number of times if the number left out of the queue at the end of this game is oddbob wins otherwisealice wins how can alice allocate integers to queues to optimize her chances of winningwhat is her chance of winningc- suppose bob has four cows that he wants to take across bridgebut only one yokewhich can hold up to two cowsside by sidetied to the yoke the yoke is too heavy for him to carry across the bridgebut he can tie (and untiecows to it in no time at all of his four cowsmazie can cross the bridge in minutesdaisy can cross it in minutescrazy can cross it in minutesand lazy can cross it in minutes of coursewhen two cows are tied to the yokethey must go at the speed of the slower cow describe how bob can get all his cows across the bridge in minutes projects - implement the stack adt with doubly linked list - implement the stack adt using the java arraylist class (without using the built-in java stack classp-