In C++ please.

Need solution for problem 1 and 2

Operator COEN 244 (Winter 2018) - Assignment 4: Polymorphism Overloading Deadline: Friday March 23rd 23:55pm Type: Group Assignment (Groups of 2 students max) Note: The assignment must be submitted on Moodle Submission format: Create only ONE zip file (.gz, tar, zip are acceptable. .rar file is NOT acceptable) that contains all the header files, cpp files and test files. The name of the file must follow the template below [student id_of_member1][student_id of member2]_A4.zip or [student id_of_member1][student_id of member2] A4.tar or [student_id of member1]_[student_id_of_member2]_A4.gz Submissions do not follow about format should be responsible for the consequences Problem statement A Graph is formally define as G (NE) consisting of the set N of vertices (or nodes) and the set E of edges, which are ordered pairs of the starting vertex and the ending vertex. Each vertex has ID and value as its basic attributes. Each edge has weight, starting vertex and ending vertex. A Graph can be a directed graph where vertices are connected by edges, and all the edges are directed from one vertex to another A Directed Acyclic Graph (DAG) is a finite directed graph with directed cycles. This means from any vertex v, there is no way to follow a sequence of edge that eventually loops back to v again An undirected graph is a graph where the edges are bidirectional. The definition of the abstract class Graph is provided below. Note that all its member functions are pure virtual. This is because the implementation of these functions is different from one graph to another. You are allowed to slightly modify this class by adding new member functions class Grapht public: GraphO; virtual Graph //add in one vertex; bool returns if it is added successfully. virtual bool addVertex (Vertex& v)-0; //Bonus question: add in a set of vertices; bool retruns if it is added successfully //virtual bool addVertices(Vertex vArray)-0; //the edges that has connection with this vertex need to be removed; virtual bool removeVertex()=0; //remove a edge as a result, some node may remain as orphan. virtual bool addEdge (Edge& e) - 0; //Bonus question remove a set of edge; as a result, some node may remain as orphan. //virtual bool addEdges(Edge eArray)0; Iremove the edne Operator COEN 244 (Winter 2018) - Assignment 4: Polymorphism Overloading Deadline: Friday March 23rd 23:55pm Type: Group Assignment (Groups of 2 students max) Note: The assignment must be submitted on Moodle Submission format: Create only ONE zip file (.gz, tar, zip are acceptable. .rar file is NOT acceptable) that contains all the header files, cpp files and test files. The name of the file must follow the template below [student id_of_member1][student_id of member2]_A4.zip or [student id_of_member1][student_id of member2] A4.tar or [student_id of member1]_[student_id_of_member2]_A4.gz Submissions do not follow about format should be responsible for the consequences Problem statement A Graph is formally define as G (NE) consisting of the set N of vertices (or nodes) and the set E of edges, which are ordered pairs of the starting vertex and the ending vertex. Each vertex has ID and value as its basic attributes. Each edge has weight, starting vertex and ending vertex. A Graph can be a directed graph where vertices are connected by edges, and all the edges are directed from one vertex to another A Directed Acyclic Graph (DAG) is a finite directed graph with directed cycles. This means from any vertex v, there is no way to follow a sequence of edge that eventually loops back to v again An undirected graph is a graph where the edges are bidirectional. The definition of the abstract class Graph is provided below. Note that all its member functions are pure virtual. This is because the implementation of these functions is different from one graph to another. You are allowed to slightly modify this class by adding new member functions class Grapht public: GraphO; virtual Graph //add in one vertex; bool returns if it is added successfully. virtual bool addVertex (Vertex& v)-0; //Bonus question: add in a set of vertices; bool retruns if it is added successfully //virtual bool addVertices(Vertex vArray)-0; //the edges that has connection with this vertex need to be removed; virtual bool removeVertex()=0; //remove a edge as a result, some node may remain as orphan. virtual bool addEdge (Edge& e) - 0; //Bonus question remove a set of edge; as a result, some node may remain as orphan. //virtual bool addEdges(Edge eArray)0; Iremove the edne