7. (3 pts) (circle one) Here is INCORRECT pseudocode for the algorithm which is supposed to determine whether a sequence of parentheses is balanced: declare a character stack while more input is available ) { read a character if the character is a') push it on the stack else if the character is a 'y' and the stack is not empty) pop a character off the stack else print "unbalanced" and exit } print "balanced Which of these unbalanced sequences does the above code think is balanced? a. ((()) b. (0) c. () d. (0) e. None of the above 8. (3 pts) (circle one) The following code fragment results in a a. memory leak b. dangling pointer_c memory freeze d. unresolved pointer = plena = (Node *) malloc (SFerk (Node)); ... // some code here Temos pMenu free (Temp); // some code here sory Rate = pMem ->data; 9. (3 pts) True/False (circle one): The following snippet of code will result in a runtime error. Assume Node is defined as: typedef struct node { char Datai struct node *Next } Node; // some code here Node *Node = NULL; Nede = (Node *) malloc (Sizeer (Node)); SERX (edade -> Data, "Test item")