Task Descriptions: $(50pts)$ Task $1$: Write Java codes $to$ create the graph below, using the adjacency list representation WITHOUT USING HASHMAP AND PLEASE OUPUT THE FOLLOWING PIC ATTACH

The graph looks like this:

Connections $of$ vertex $A$: $B,E,D$

Connections $of$ vertex $B$: $E$

Connections $of$ vertex $C$: $B$

Connections $of$ vertex $D$: $G$

Connections $of$ vertex $E$: $F,H$

Connections $of$ vertex $F$: $C,H$

Connections $of$ vertex $G$: $H$

Connections $of$ vertex $H$: $I$

Connections $of$ vertex I: $F$

Neighbors $of$ vertex $E$: $F,H$

$(50pts)$ Task $2$: Based $on$ your codes $of$ 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 $Eof$ the graph above and print 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.