Write a method that, given a non-empty queue of integers, returns the largest value. The queue should have the same contents as before the call. Of course, you can remove elements to inspect them, but you need to add them back into the queue. import java.util.Queue; import java.util.Arrays; import java.util.LinkedList; Queues.java Queue Tester.java public class QueueTester { public static void main(String[] args) { Queue q = new Linked List (Arrays.asList(1, 2, 3, 4, 5)); int largest = Queues.getLargest (q); System.out.println(largest); System.out.println("Expected: 5"); System.out.println(q); System.out.println("Expected: [1, 2, 3, 4, 5]"); q = new Linked List (Arrays.asList(5, 4, 3, 1, 2)); largest = Queues.getLargest (q); System.out.println(largest); System.out.println("Expected: 5"); System.out.println(q); System.out.println("Expected: [5, 4, 3, 1, 2]"); q = new Linked List (Arrays.asList(4, 5, 6, 5)); largest = Queues.getLargest (q); System.out.println(largest); System.out.println("Expected: 6"); System.out.println(q); System.out.println("Expected: [4, 5, 6, 5]"); q = new Linked List (Arrays.asList(3)); largest = Queues.getLargest (q); System.out.println(largest); System.out.println("Expected: 3"); System.out.println(q); System.out.println("Expected: [3]"); } } Write a method that, given a non-empty queue of integers, returns the largest value. The queue should have the same contents as before the call. Of course, you can remove elements to inspect them, but you need to add them back into the queue. Queues.java Queue Tester.java 1 import java.util.Queue; 2 public class Queues 3 { 1234567800-234 14 } 9 { 10 11 12 13 } /** * Returns the largest number from the queue. The queue has the same contents after the call. public static Integer getLargest (Queue q) * Your code goes here */ Check