I need a [ UML diagram ] (code for java is not needed) for an accounting department project that uses all of the requirements below. I would be happy if you could answer it as soon as possible!

Grade No. Item Description 1 - Create - Create at classes (10 least 3 classes points) with the functions which implement items No-2 onward 2 - Static Array - create a static (5 points) array - use the search function to find an element 3 - Dynamic - create Array (20 a dynamic points) array - try to add an element to the array - try to delete an element and shift other elements 4 - ArrayList (20 - Create an points) ArrayList: (free to use any list function) - Use 5 functions that belong ONLY to the Arraylist - Travers the Arraylist 5 - Stack (10 points) - Create a Stack: (free to use any list function) - Use 5 functions that belong ONLY to the Stack - Travers the Stack using BOTH iterator and loop 6 - Queue (10 points) - Create a Queue:(free to use any list function) - Use 5 functions that belong ONLY to the Queue - Travers in the Queue 7 - Dequeue (10 Create a points) Dequeue: (free to use any list function) - Use 5 functions that belong ONLY to the Dequeue - Implement it as Queue - Implement it as Stack 8 8 - Revers the Reverse the list (10 points) list by using the stack and print the list before and after reversing. 9 - Linked List - Create a (10 points) linked list: (free to use any list function) - Use 1+4 functions that belong ONLY to the Linked List - One of the functions must be hardcoded (the body of that function is written by you) while for the other 4s you can use a ready one. 10 -Tree (10 - Create a tree: points) (free to use any list function) - Use 1+4 functions that belong ONLY to the tree - One of the functions must be hardcoded (the body of that function is written by you) while for the other 4s you can use a ready 11 BST (Extra Mark) - Create a BST data structure in your project 12 Graph (Extra Mark) - Create a graph data structure in your project. 13 - Access and -Implement non-access Abstract and modifiers (12 Final Class, points) method, and variable (At least one item for each) 14 - Implement OOP concepts inheritance, (8 points) polymorphism, abstract and encapsulation concepts 15 - Time and - For one of Space your classes Complexity with more than (10 points) 2 functions, calculate the: - Time Complexity - Space Complexity