Pop(). Suppose that for the above sequence, each alphabet corresponds to a Push() operation onto the stack and each asterisk ( ) correspond to a Pop() operation. Show the sequence of alphabets returned by all the Pop() operations. b) The adjacency matrix representation of a graph G is given below. Draw the corresponding graph and perform DFS traversal by considering ' A ' as the source. Show all your steps. [1+1+2=4M]