Given the graph, please write a java class named Graph.java that: - Inserts a NumberFormat class - Includes an adjacency matrix to represent the graph - Has a constructor that takes a String array of city names as a parameter. - Given two endpoints and the weight of the edge, you will add the edge to the graph. - Build the MST from vertex 0. - Ensure that you utilize prims properly. - Include an overloaded addEdge method and overloaded prims method.

VariableReferenceNode.java, OperationNode.java, ConstantNode.java, and PatternNode.java must have their own java classes with the correct methods implemented: OperationNode: Has enum, left and Optional right members, good constructors and ToString is good VariableReferenceNode: Has name and Optional index, good constructors and ToString is good Constant & Node Pattern: Have name, good constructor and ToString is good Make sure to include the screenshot of the output of Parser.java as well.

The main question is the entire page labeled Program #1, the little screenshot is for extra steps. The program has to be written in Java.

In Java, Create Movie class, which has private fields for title, director, rating. It has a constructor to initialize these fields and a toString method for printing movie details. There is also a getRating method to retrieve the movie rating. Create Rating Comparator class which implements the Comparator interface for comparing movies based on their ratings. Create DemoMovies Class. Initialize necessary data structures like LinkedList, TreeMap for rating as key and Movie from Movie class as value, TreeSet, and ProtiyQueue. Use a loop to take user input for movie detailsuntil the user enters 'WWW' as the movie title.Inside the loop, for each movie, create a Movie object, add it to various data structures that is title, director and rating based on the constructor. Add the Movie object to the LinkedList. Add the rating and the object to the TreeMap.Add the rating to the TreeSet.Add the Movie object to the Priority Queue.Display the entered movies. Sort and display Movies by rate by...

1. Given a Vertex object x, give Java code to enumerate its outgoing edges. ("Enumerate" means "to list"; your code does not need to do anything with the edges, but should be setup code that would make it easy to do something with each edge if we wanted to add that in.) 2. Given a VertexAndDist object x and a new distance d, give Java code to create an updated object with the same vertex as x but with distance d. 3. For simplicity of implementation, we use HashMaps to map vertices to handles/parents and edges to weights. How could you modify the Vertex and/or Edge classes, as well as the maps themselves, to implement the maps using ordinary arrays, with no hashing? Be sure to address both the vertex and edge maps in your answer. (Hint: consider the Vertex's "id" field for inspiration.)