I need quick answer in c++ ?

Page -200M+ Assignment 5 The following figure is called a graph. The circles are called nodes, and the lines are called edges. An edge connects two nodes. You can interpret the graph as a maze of rooms and passages. The nodes can be thought of as rooms and an edge connects one room to another. Note that each node has at most four edges in the following graph STAR LFINISH Write a program implements the above maze using references to instances of a Node which contains the name of the node and four pointers, one for each of the directions (North n, South s, East e and West w). Each de in the graph will correspond to an instance of Node. The edges correspond to links that connect one node to another and can be represented as pointers to other nodes. s goal is to reach the finish in node. The program should output possible moves in the north (n), south (s), east (el, or west (w) direction. Then the user inputs any of the four directions (n, s, e, w). After that your program checks whether that's a valid move or not. If valid, it will usher her/him to the desired room, othervise prints an error message and prompt again for desired direction. Start the user at node A. The user' Sample execution scenario is shown next: You aze n FO A oF a maze of ewisty litzie passages, a:l Which dizectign would you dike to goa . NEC Page -200M+ Assignment 5 The following figure is called a graph. The circles are called nodes, and the lines are called edges. An edge connects two nodes. You can interpret the graph as a maze of rooms and passages. The nodes can be thought of as rooms and an edge connects one room to another. Note that each node has at most four edges in the following graph STAR LFINISH Write a program implements the above maze using references to instances of a Node which contains the name of the node and four pointers, one for each of the directions (North n, South s, East e and West w). Each de in the graph will correspond to an instance of Node. The edges correspond to links that connect one node to another and can be represented as pointers to other nodes. s goal is to reach the finish in node. The program should output possible moves in the north (n), south (s), east (el, or west (w) direction. Then the user inputs any of the four directions (n, s, e, w). After that your program checks whether that's a valid move or not. If valid, it will usher her/him to the desired room, othervise prints an error message and prompt again for desired direction. Start the user at node A. The user' Sample execution scenario is shown next: You aze n FO A oF a maze of ewisty litzie passages, a:l Which dizectign would you dike to goa . NEC