2. (20 points) See the below stack operations on a graph when Depth-First-Search algorithm is applied to traverse on a given graph. In addition, the degree values of each vertex are also given. By using the given information, draw the graph which satisfies these properties. Hint: When you have more than one options to select the next vertex for DFA, 2/4 vertex should be selected at first. Stack s = new Stack(); s.push(0); s.push(9); s.push(8); s.push(7); s.push(10); s.push(11); s.pop(11); s.pop(10); s.push(6); s.push(5); s.push(3); s.push(4); s.pop(4); s.push(2); s.pop(2); s.pop(3); s.pop(5); s.pop(6); s.pop(7); s.push(1); s.pop(1); s.pop(); s.pop(9); s.pop(0); = 1, deg(0) 2, deg(1) = 2, deg (2) deg(3) = 4, deg(4) = 1, deg(5) = 2, deg(6) = 2, deg(7) 5, deg(8) = 3, deg (9) 2, deg(10) = 2, deg(11) = 2