Problem 1(9 points): Answer the following questions for the functions dskqopt and ethinter

1. Create and save the CFG using Atlas and include them in your answers for the next questions. (2 points)
2. Mark on each CFG the Entry, Exit, nodes and the Loop-back edges for each loop. (3 points)
3. Create the directed acyclic graph (DAG) removing the loop back edges (2 points)
4. Give the number of paths for the above DAGs (2 points)