Task 1: Write a program which reads a circuit specification and resource constraints from a text file and print-out the LIST scheduling

Task 1: Write a program which reads a circuit specification and resource constraints
from a text file and print-out the LIST scheduling. The file contains the information
as given below
First line total number of nodes. Second line onwards the neighbours of each node,
one line per node. It will be encoded in binary format. Following that each line
encodes the type of operation performed by a node and the time taken for that.
After that the number of each available resource. The algorithm should try to find
the schedule with minimum latency.
Eg:
6 > shows graph has 6 nodes (including source and sink)
011000 - First node (source node) is predecessor to nodes 1 and 2
000110 > Node 1 is predecessor to nodes 3 and 4
000010 > Node 2 is predecessor to node 4
000001 > Node 3 is predecessor to sink node
000001 7? Node 4 is predecessor to sink node
000000 — Last node (sink node) has no successors
nop 0 > source node, no op, delay 0
*2 > node 1, multiplication, delay 2
*2 > node 2, multiplication, delay 2
+1 > node 3, addition, delay 1
-1 > node 4, subtraction, delay 1
nop 0 > sink node, no op, delay 0
* 2 > 2 multipliers are available
+,- 2 > Addition and subtraction is done by same resource and there are 2 of them
Your program should improvise the graph representation and priority encoder that
we have developed. Other library functions are not allowed.