Draw a UML class diagram for the following code: import java.util.*; public class QueueOperationsDemo {     public static void main(String[] args) {         Queue linkedListQueue = new LinkedList<>();         linkedListQueue.add("Apple");         linkedListQueue.add("Banana");         linkedListQueue.add("Cherry");         System.out.println("Is linkedListQueue empty? " + linkedListQueue.isEmpty());         System.out.println("Front element: " + linkedListQueue.peek());         System.out.println("Removed element: " + linkedListQueue.remove());         System.out.println("Front element after removal: " + linkedListQueue.peek());         Queue arrayDequeQueue = new ArrayDeque<>();         arrayDequeQueue.add(10);         arrayDequeQueue.add(20);         arrayDequeQueue.add(30);         System.out.println("Is arrayDequeQueue empty? " + arrayDequeQueue.isEmpty());         System.out.println("Front element: " + arrayDequeQueue.peek());         System.out.println("Removed element: " + arrayDequeQueue.remove());         System.out.println("Front element after removal: " + arrayDequeQueue.peek());         Queue priorityQueue = new PriorityQueue<>();         priorityQueue.add(5.5);         priorityQueue.add(3.3);         priorityQueue.add(7.7);         System.out.println("Is priorityQueue empty? " + priorityQueue.isEmpty());         System.out.println("Front element: " + priorityQueue.peek());         System.out.println("Removed element: " + priorityQueue.remove());         System.out.println("Front element after removal: " + priorityQueue.peek());

Draw a UML class diagram for the following code:

import java.util.*;

public class QueueOperationsDemo {
    public static void main(String[] args) {
        Queue<String> linkedListQueue = new LinkedList<>();
        linkedListQueue.add("Apple");
        linkedListQueue.add("Banana");
        linkedListQueue.add("Cherry");

        System.out.println("Is linkedListQueue empty? " + linkedListQueue.isEmpty());

        System.out.println("Front element: " + linkedListQueue.peek());
        System.out.println("Removed element: " + linkedListQueue.remove());
        System.out.println("Front element after removal: " + linkedListQueue.peek());
        Queue<Integer> arrayDequeQueue = new ArrayDeque<>();
        arrayDequeQueue.add(10);
        arrayDequeQueue.add(20);
        arrayDequeQueue.add(30);

        System.out.println("Is arrayDequeQueue empty? " + arrayDequeQueue.isEmpty());

        System.out.println("Front element: " + arrayDequeQueue.peek());
        System.out.println("Removed element: " + arrayDequeQueue.remove());
        System.out.println("Front element after removal: " + arrayDequeQueue.peek());
        Queue<Double> priorityQueue = new PriorityQueue<>();
        priorityQueue.add(5.5);
        priorityQueue.add(3.3);
        priorityQueue.add(7.7);

        System.out.println("Is priorityQueue empty? " + priorityQueue.isEmpty());

        System.out.println("Front element: " + priorityQueue.peek());
        System.out.println("Removed element: " + priorityQueue.remove());
        System.out.println("Front element after removal: " + priorityQueue.peek());
}