5. (60 points total) a. Write a function, called is Complete, which returns true if a directed graph with no loops is complete, false otherwise. b. Write a function, called oneChild, that returns the number of nodes with exactly one child.

5. ( 60 points total) a. Write a function, called is Complete, which returns true if a directed graph with no loops is complete, false otherwise. b. Write a function, called oneChild, that returns the number of nodes with exactly one child