25. how many edges are there in a complete indirected graph with 3 nodes? 2 Points) 6 All answers are false 03 O 4 8. An empty stack is implemented using linked list, after applying the following operation (push('F), push('T'). pop().push('S'), pop().push('R"), push("W")] which node has next = null; (2 Points) 19. An empty stack is implemented using array, after applying the following operation [push('F"), push('T'), pop().push('S'). pop().push('R'), push('W')] what is the value of top? (2 points) Node with data ='W All answers are false Node with data = 'F o 2 Node with data = 'S' 3 All answers are false