Please help with Discussion Post, thumbs up ASAP

Question 1: By midnight Thursday, demonstrate graph representation and traversal, as follows: Present a graph (can be directed or undirected) with at least 7 nodes, numbered 1 to N, and at least 10 edges. Show how the graph would be represented using an adjacency list. Demonstrate graph traversals as follows: Note that adjacent nodes can be inserted into the stack/queue using either one of two methods: Insert any adjacent nodes into the stack/queue in numeric order, smallest to largest Insert any adjacent nodes into the stack/queue in numeric order, largest to smallest. First choose which of these two methods you will use, state which one you are using, and use the same method for both traversals. Then, using the traversal algorithms from the online Content, choose a starting node, and show the order that the nodes would be visited two ways: Using breadth first traversal Using depth first traversal