1. Modify the "Graph" program given in the textbook (program 4.5.1) to create, a program, "SubGraph". It would take a filename and vertices as input arguments on the command line. It would create, and print out a graph using the data specified in the file (as is done by the "Graph" program). And then it would also print out the subgraph of the graph formed by the vertices that are given on the command line.[MO7.2]

Note:The induced subgraph is the graph comprised of the specified vertices together with all edges from the original graph that connect any two of them.

• The input and output of the program should be similar to, or as specified by, the following sample run.

>more graph.txt

A B

A C

C G

A G

H A

B C

B H

>java SubGraph graph.txt A C G

The graph is

A: B C G H

B: A C H

C: A B G

G: A C

H: A B

The subgraph is

A: C G

C: A G

G: A C

program 4.5.1 Graph data type public class Graph private ST.String, SET adjacentTo(String v) { return st. get(v); } public Iterable vertices() ( return st. keys () ; } 7/ See Exercises 4.5.1-4 for VO, EO. degree0. / hasVertex (), and hasEdge(). public static void main (String args) i // Read edges from standard input; print resulting ge Graph G = new Graph() ; while (IStdIn. isEmpty () ) G. addEdge (StdIn . readString(), StdIn. readStringO): StdOut . print (G) ; The implementation uses ST and SET (see SECTION 4.4) to implement the graph lim type Winds build graphs by adding edges and process them by iterating over the vertion and thin Mer the ser of vertices adjacent to each vertex. See the text for toString() and a matchin mustructor that reads a graph from a file. more tinyGraph. txt % java Graph