Java please!

Represent the edges in your graph as a two-dimensional array of integers. Use the distances shown in the graph pictured here. Add the following functions to your graph class:

• A getDistance function that takes two vertices and returns the length of the edge between them. If the vertices are not connected, the function should return the max value for an integer.
• A getNeighbors function that takes a single vertex and returns a list of all the vertices connected to that vertex.
• A print method that outputs an adjacency matrix for your graph.

Write a test program for your Graph class.

GRAPH

Coconino Navajo 3 Apache 14 0 Mohave 20 19 11 Yavapai 18 10 Gla Greenlee Graham 13 16 15 12 Pinal Maricopa 5 Cochise 15 10 18 12 La Paz 7 Pima 11 13 Yuma 23 6 Santa Cruz vertices[0] Mohave vertices(1) Coconino vertices[2] Navajo vertices[3] Apache vertices[4] Greenlee vertices[5] Cochise vertices[6] Santa Cruz vertices[7] Pima vertices[8] Pinal vertices[9] Graham vertices[10] Gila vertices[11] Yavapai vertices[12] La Paz vertices[13] Yuma vertices[14] Maricopa