Please help me solve the following problem, I have been trying for hours and do not know where I am going wrong, I know its you ChatGPT, please can a real person help me$!!$ Take a digraph, delete node $n-3$ then write out the reverse of the resulting

digraph $30$ Marks

For each digraph in a set of digraphs given as adjacency lists, read in the digraph,

File Preview

h index $(n-3),$ where $n$ is the order of the original digraph. Then

using the resulting digraph and write it back out to standard output

lists$).$

Input format: described below under the heading "Digraph input format". All

input digraphs have order $n3.$

Output format: Print $($to sys$.$stdout, the default for print$)$ the modified digraph

using the same style as used for the input format, maintaining the conventions that

nodes are labeled $0,1,$dots,$n-1$ and adjacency lists are sorted.

For the example input shown below, the output would be

$3$

$1$

$0$

$2$

$1$

$0$

Here the first line indicates the order of the new digraph is $3,$ the next $3$ lines are the

$3$ adjacency lists showing the arcs of this digraph where nodes have been relabeled

to maintain our labelling convention. The next line is a $2$ indicating that the next

digraph has order $2$ and so on$.$Digraph input format

A sequence of one or more digraphs is taken from the standard input $($sys$.$stdin$).$ Each

graph is represented by an adjacency list. All input digraphs have order n $>=3.$ The

first line is an integer n indicating the order of the digraph. This is followed by n white

space separated lists of adjacencies for nodes labeled $0$ to n $-1.$ The lists are sorted. The

input will be terminated by a line consisting of one zero $(0).$ This line should not be

processed. The sample input below shows two digraphs, the first has node set $\{0,1,2,3\}$

and arc set $\{(0,1),(0,3),(1,2),(1,3),(2,0)\},$ the second has node set $\{0,1,2\}$ and arc set

$\{(0,1),(0,2),(2,1)\}.$

$4$

$13$

$23$

$0$

$3$

$12$

$1$

$0$