Edit the c$++$ code so that the output looks like this:

Sample Run:

Nodes $[2-26]$: $7$

Edges: $8$

Edge values: HC GH AB BF BC FG CD DA

The network:

A$--$B$-------$F

$|||$

D$--$C$--$H$---$G

Run Again $($Y$/$N$)$: n

#include

#include

#include

#include

#include

using namespace std;

$//$ Function to validate and parse the edge input

bool parseEdges$($int n$,$ map$>$& adjList$)\{$

string edge;

for $($int i $=0$; i $<$ n; $++$i$)\{$

cin $>>$ edge;

if $($edge$.$length$()!=2||$ edge$[0]==$ edge$[1]||$ edge$[0]<\text{'}$A$\text{'}||$ edge$[0]>\text{'}$Z$\text{'}||$ edge$[1]<\text{'}$A$\text{'}||$ edge$[1]>\text{'}$Z$\text{'})\{$

cout $<<$ "Invalid edge input: $"<<$ edge $<<$ endl;

return false;

$\}$

$//$ Assuming undirected graph, add edge in both directions

adjList$[$edge$[0]].$insert$($edge$[1])$;

adjList$[$edge$[1]].$insert$($edge$[0])$;

$\}$

return true;

$\}$

$//$ Function to draw the network based on the adjacency list

void drawNetwork$($const map$>$& adjList$)\{$

vector$>$ grid$(2*(\text{'}$Z$\text{'}-\text{'}$A$\text{'})+3,$ vector$(4*(\text{'}$Z$\text{'}-\text{'}$A$\text{'})+5,\text{'}\text{'}))$;

$//$ Draw horizontal edges

for $($auto& node : adjList$)\{$

char currentNode $=$ node.first;

for $($char connectedNode : node.second$)\{$

if $($currentNode $<$ connectedNode$)\{$

int x $=1*($currentNode $-\text{'}$A$\text{'})+0$;

int y $=2*($connectedNode $-\text{'}$A$\text{'})+1$;

grid$[$x$][$y$]=\text{'}-\text{'}$;

grid$[$x$][$y $+1]=\text{'}-\text{'}$;

$\}$

$\}$

$\}$

$//$ Draw vertical edges

for $($auto& node : adjList$)\{$

char currentNode $=$ node.first;

for $($char connectedNode : node.second$)\{$

if $($currentNode $<$ connectedNode$)\{$

int x $=2*($currentNode $-\text{'}$A$\text{'})+2$;

int y $=4*($connectedNode $-\text{'}$A$\text{'})+1$;

grid$[$x$][$y$]=\text{'}|\text{'}$;

$\}$

$\}$

$\}$

$//$ Add corner labels

grid$[0][1]=\text{'}$A$\text{'}$;

grid$[0][2*(\text{'}$Z$\text{'}-\text{'}$A$\text{'})+2]=\text{'}$B$\text{'}$;

grid$[(\text{'}$Z$\text{'}-\text{'}$A$\text{'})+1][1*(\text{'}$Z$\text{'}-\text{'}$A$\text{'})+0]=\text{'}$C$\text{'}$;

grid$[1*(\text{'}$Z$\text{'}-\text{'}$A$\text{'})+1][0]=\text{'}$D$\text{'}$;

grid$[0][1*(\text{'}$Z$\text{'}-\text{'}$A$\text{'})+2]=\text{'}$E$\text{'}$;

grid$[0][1*(\text{'}$Z$\text{'}-\text{'}$A$\text{'})+2]=\text{'}$F$\text{'}$;

grid$[1*(\text{'}$Z$\text{'}-\text{'}$A$\text{'})+0][1*(\text{'}$Z$\text{'}-\text{'}$A$\text{'})]=\text{'}$G$\text{'}$;

grid$[1*(\text{'}$Z$\text{'}-\text{'}$A$\text{'})+0][1]=\text{'}$H$\text{'}$;

$//$ Print the grid

for $($int i $=0$; i $<$ grid.size$()$; $++$i$)\{$

for $($int j $=0$; j $<$ grid$[$i$].$size$()$; $++$j$)\{$

cout $<<$ grid$[$i$][$j$]$;

$\}$

cout $<<$ endl;

$\}$

$\}$

$//$ Main function

int main$()\{$

char runAgain $=\text{'}$Y$\text{'}$;

do $\{$

int m$,$ n;

cout $<<$ "Nodes $[2-26]$: $"$;

cin $>>$ m;

if $($m $<2||$ m $>26)\{$

cout $<<$ "Invalid number of nodes. Please enter a value between $2$ and $26."$;

continue;

$\}$

cout $<<$ "Edges: $"$;

cin $>>$ n;

if $($n $<=0)\{$

cout $<<$ "Invalid number of edges. Please enter a positive number.";

continue;

$\}$

map$>$ adjList; $//$ Adjacency list to store the graph

cout $<<$ "Edge values: $"$;

if $(!$parseEdges$($n$,$ adjList$))\{$

cout $<<$ "Error parsing edges. Please try again.";

continue;

$\}$

$//$ Drawing the network

cout $<<"$

The network:

$"$;

drawNetwork$($adjList$)$;

$//$ Clear the input buffer

cin.ignore$($numeric$\_$limits::max$(),\text{'}$

$\text{'})$;

$//$ Asking the user if they want to run the program again

cout $<<$ "Run Again $($Y$/$N$)$: $"$;

cin $>>$ runAgain;

runAgain $=$ toupper$($runAgain$)$;

$\}$ while $($runAgain $==\text{'}$Y$\text{'})$;

return $0$;

$\}$