30. As discussed in this section, instead of having our queue methods throw exceptions in the case of"erroneous" invocations, we could have the queue methods handle the situation themselves. We define the following two "safe" methods: boolean safeEnqueue (T element) adds element to the rear of the queue; returns true if element successfully added, false otherwise T safeDequeue returns null if this queue is empty; otherwise removes front element from this queue and returns it a. Add these operations to the ArrayBoundedQueue class. Create a test driver application to demonstrate that the added code works correctly. Add these operations to the LinkedQueue class. Create a test driver application to demonstrate that the added code works correctly. b. 30. As discussed in this section, instead of having our queue methods throw exceptions in the case of"erroneous" invocations, we could have the queue methods handle the situation themselves. We define the following two "safe" methods: boolean safeEnqueue (T element) adds element to the rear of the queue; returns true if element successfully added, false otherwise T safeDequeue returns null if this queue is empty; otherwise removes front element from this queue and returns it a. Add these operations to the ArrayBoundedQueue class. Create a test driver application to demonstrate that the added code works correctly. Add these operations to the LinkedQueue class. Create a test driver application to demonstrate that the added code works correctly. b