You will perform two topological sorts on the directed graph to the right: When the processing of a vertex creates more than one new pending vertex, add the new pending vertices to your set of pending vertices in alphabetical order (e.g., push (X). push (Y), push (2)). In-degree For each topological sort, use the provided tables to compute the topological sort and your final solution. Show your work to allow partial credit (e.g., show adding and removing from the set). Queue Final (a) Perform a topological sort using a queue to maintain the set of pending vertices. A In-degree H Stack E Final (b) Perform a topological sort using a stack to maintain the set of pending vertices: A DEF G H A B C D E F G H J I J