Please see the attached file for detailed instructions on how to answer the questions for this assignment. The questions consist of graphs, digraph, breath first traversal, depth first traversal and implementing an in-place version of insertion sort with the following prototype node *insertion sort(node * head).

If you have further questions, please reach out to me so I can better clarify it. Thank you.

"Is this question part of your assignment? We can help"