Task Descriptions:
(50 pts) Task 1: Write Java code to create the graph below using the adjacency list representation.
(50 pts) Task 2: Based on your code from Task 1, implement a neighbor function that returns an array containing the neighbors of a vertex. Please test your implemented neighbor function to obtain the neighbors of the vertex E of the graph above and print them out.
This project will be graded based on the quality of your program. Please note that Java interface and generic data types are NOT required in this project.