Write java program to store any given graph using the following strategies:

Task $1.$ Adjacency Matrix $($a regular $vv2-$D array$)$

Task $2.$ Adjacency Matrix $($using ragged array$)$

Task $3.$ Adjacency List

Your program must ask the number of vertices and then the list of vertices to store. Afterwards, the adjacent vertices to each of the vertex to store the information.

You may consider the following simple graph to test your program.

A sample output for Task $1$ is given below.A sample output for Task $2$ is given below.