IN JAVA

import java.util.*; public class QueueExample { public static void main (String[] argv) { // We'll use Java's LinkedList as our queue. LinkedList taskQueue = new LinkedList(); // Add some strings. taskQueue.add ("Pay bills"); taskQueue.add ("Clean room"); taskQueue.add ("Do homework"); taskQueue.add ("See movie"); taskQueue.add ("Hang out"); // Now extract in "queue" order using the removeFirst() method in LinkedList. System.out.println (taskQueue.removeFirst()); System.out.println (taskQueue.removeFirst()); System.out.println (taskQueue.removeFirst()); System.out.println (taskQueue.removeFirst()); System.out.println (taskQueue.removeFirst()); System.out.println ("=> Tasks remaining: " + taskQueue.size()); } }

In-Class Exercise 9: Modify Queue Example.java above to use Java's ArrayList instead of a LinkedList. You may need to look at the Java API's to see which of ArrayList's remove methods you could use