Create a Class called Chapter14.java with public static methods that provide solutions to the following Exercises in the text. with the following significant modifications, so please read carefully. Replace int with
computer science
Description
Create a Class called Chapter14.java with public static methods that provide solutions to the following Exercises in the text. with the following significant modifications, so please read carefully. Replace int with Where the text exercises say "may use" a queue, change that to MUST use a queue as auxiliary storage. All these Exercises require you use only the basic Stack methods such as push, peek, and pop. So you cannot simply sort it, nor access internal elements like a List, you must write a bunch of pop, push, peek, etc... loops. To enforce this requirement, I will use my own version of the Stack Class: Stack.java So do NOT import java.util.Stack; Other Classes in java.util are OK like you need those for the Queues. I will use in each case for testing purposes, so use compareTo as appropriate. CalendarDate.java Stacks can be empty, so don't let your code blow up in those cases. I see no need to intentionally throw Exceptions in these exercises. For example, on #2, if the Stack is empty, just return an empty Stack. If we examine two Stack objects (#5), be able to handle the case that they are the same object. And two empty Stack objects are equal, yes. 2. stutter, modify to return the stuttered Stack and leave the original Stack unchanged. 5. equals, use the compareTo method for comparisons, leave the original Stacks unchanged. 15. isSorted, use compareTo to evaluate if sorted and leave the original Stack unchanged. 19. removeMin, use compareTo for evaluating the minimum. Only the last method here will modify the Stack passed in as a parameter. Do NOT use Vector operations. But I do encourage whatever Queue you desire for auxiliary storage, a LinkedList, Deque, or other...
