$$Opens a text file called graph.txt which defines a graph data structure in the following format: $<$A $|$B C $><$B $|$D $><$C $|$D E $><$E $|$F $><$F $|$G $>$Showing each node and its immediate successor nodes. $$You may assume node names are single letters $$Add support for the following two commands to your system: Sub$-$question Description Q$2-$A Command: numpathsfrom Parameters: A single node name Behaviour: Shows the number of paths which start at the given node and end at a node with no successors. Expected output on test data $($A$)$: $3$Q$2-$B Command: pathsfrom Parameters: A single node name Behaviour: Shows the nodes in the paths which start at the given node and end at a node with no successors. Each path is shown on a single line with a space separating each node. Expected output on test data$($A$)$: A B D A C D A C E F G using lua