How to change this Java code to accept character value instead of integer for edges u and v:   import java.util.*; public class Main {   privateintV;// number of vertices   privateArrayList> adj;// adjacency list       privateclassEdge{   int v;// vertex   int bandwidth;// bandwidth       publicEdge(int v,int bandwidth){   this.v = v;   this.bandwidth = bandwidth;   }   }       publicMain(intV){   this.V=V;   adj = new ArrayList>(V);   for(int i =0; i ());   }   }       publicvoidaddEdge(int u,int v,int bandwidth){   adj.get(u).add(new Edge(v, bandwidth));   adj.get(v).add(new Edge(u, bandwidth));   }       publicintmaxBandwidth(int a,int b){   PriorityQueue pq =newPriorityQueue(V,Collections.reverseOrder());   HashMap visited =newHashMap();   HashMap parent =newHashMap();   pq.add(a);   visited.put(a, Integer.MAX_VALUE);   parent.put(a, -1);   while(!pq.isEmpty()){   int u = pq.poll();   if(u == b){   break;   }   for(Edge e : adj.get(u)){   int v = e.v;   int bandwidth = e.bandwidth;   if(!visited.containsKey(v)){   int minBandwidth =Math.min(visited.get(u), bandwidth);   visited.put(v, minBandwidth);   parent.put(v, u);   pq.add(v);   }   }   }   int maxBandwidth = visited.get(b);   int curr = b;   ArrayList path =newArrayList();   while(curr !=-1){   path.add(0, curr);   curr = parent.get(curr);   }   System.out.println("Maximum bandwidth path from "+ a +" to "+ b +": "+ path);   return maxBandwidth;   }       public static void main(String[] args){   Main g = new Main(5); g.addEdge(0, 1, 10); g.addEdge(0, 2, 5); g.addEdge(1, 2, 7); g.addEdge(1, 3, 3); g.addEdge(2, 3, 2); g.addEdge(2, 4, 6); System.out.println("Maximum bandwidth from 0 to 4: " + g.maxBandwidth(0, 4));

PLEASE HELP, PYTHON THANK YOU def add_vertex(self, vertex):        if vertex not in self.__graph_dict:            self.__graph_dict[vertex] = []    def add_edge(self, edge):        edge = set(edge)        (vertex1, vertex2) = tuple(edge)        #################        # Problem 4:        # Check to see if vertex1 is in the current graph dictionary        ##################        #DELETE AND PUT IN THE IF STATEMENTS            self.__graph_dict[vertex1].append(vertex2)        else:            self.__graph_dict[vertex1] = [vertex2]    def __generate_edges(self):        edges = []        #################        # Problem 5:        # Loop through all of the data in the graph dictionary and use the variable vertex for the loop'ed data        ##################        #DELETE AND PUT IN THE LOOP STATEMENTS            for neighbour in self.__graph_dict[vertex]:                if {neighbour, vertex} not in edges:                    edges.append({vertex, neighbour})        return edges…

Consider the following class map, class map { public: map(ifstream &fin); void print(int,int,int,int); bool isLegal(int i, int j); void setMap(int i, int j, int n); int getMap(int i, int j) const; int getReverseMapI(int n) const; int getReverseMapJ(int n) const; void mapToGraph(graph &g); bool findPathRecursive(graph &g, stack<int> &moves); bool findPathNonRecursive1(graph &g, stack<int> &moves); bool findPathNonRecursive2(graph &g, queue<int> &moves); bool findShortestPath1(graph &g, stack<int> &bestMoves); bool findShortestPath2(graph &, vector<int> &bestMoves); void map::printPath(stack<int> &s); int numRows(){return rows;}; int numCols(){return cols;}; private: int rows; // number of latitudes/rows in the map int cols; // number of longitudes/columns in the map matrix<bool> value; matrix<int> mapping; // Mapping from latitude and longitude co-ordinates (i,j) values to node index…

Code debug JAVA     import java.util.ArrayList;public class ArrayList {public static ArrayList<Integer> reverse(ArrayList<Integer> list) {for (int i = 0; i < list.size(); i++) {System.out.println(list);}public static ArrayList<Integer> getReverse(ArrayList<Integer> list){for (int index = 0; index < list.size() / 2; index++) {int temp = list.get(index);list.set(index, list.get(list.size() - index - 1));//swaplist.set(list.size() - index - 1, temp); //swap}return list;}}public static void main(String[] args) {ArrayList<Integer> list = new ArrayList<>();list.add(1);list.add(2);list.add(3);System.out.println("Original elements : " + list);System.out.println("Reversed elements : " + getReverse(list));}}