[Q1] ---->>>> USING C++ Returns true if the graph can be considered an undirected graph. I.e. if for every edge v -> w there is also an edge w -> v with exactly the same weight. bool is_undirected() const

You are given an incomplete class in graph.h representing a directed weighted graph. The graph is represented using an adjacency list that stores objects of type Edge in the adjacency list of each vertex. Each Edge object represents a directed weighted edge, storing the weight, the source vertex (from) and the destination vertex (to). 8 2 frono to a weight 4 from o to 1 weight 7 from @ to 2 weight from 1 1 5 5 4 6 2 2 -:- 3 0 0 from = 0 to 3 weight = 4 from = 0 to 11 weight = 7 from = @ to = 2 weight = 5 1 from = 1 to = 3 weight = 6 N 3 from = 3 to - 1 weight = 2 from = 3 to 22 weight = 1 25 24 // Represents a directed weighted graph. Can also 25 // be used to represent an undirected weighted graph. 26 class Graph { 27 private: 28 int V; Il number of vertices 29 list *adj; // adjacency lists 30 31 public: 32 Graph(int v) { 33 this->V = V; 34 adj = new list [V]; 35 } 36 -Graph() { delete [] adj; } 37 int get_VO) const { return V; } 38 39 // adds an edge from v to w with the given weight 40 void add_edge(int v, int w, double weight) { 41 if (weight