7. Consider the usual algorithm for determining whether a sequence of parentheses is balanced. The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))?a) 1b) 2c) 3d) 4 or more

Consider the usual implementation of parentheses balancing program using stack. What is the maximum number of parentheses that will appear on stack at any instance of time during the analysis of ( ( ) ( ( ) ) ( ( ) ) )?1 point1234

A sequence of parentheses is called balanced if it consists entirely of pairs of opening/closing parentheses (in that order), which is well nested. For example, sequences "(())()", "()" and "(()(()))" are balanced, while "(()" and "(()))(" are not. Write a program to determine if a given string contains a balanced sequence of parentheses. The input to the function balanced parentheses is a string str. Each character in the string will be "(" or ")". The output is the count of balanced pairs if the sequence is balanced or -1 otherwise. For example, if the input sequence is "(()(()))", the expected output is 4.

Check for Balanced ParenthesesWrite a function that takes a string of parentheses and checks if the parentheses are balanced using a stack.Constraints:NAExample:Sample Input-1:(())Sample Output-1:trueSample Input-2:((Sample Output-2:falseExplanation:In both of these examples, parentheses must appear in a balanced fashion. Balanced parentheses means that each opening symbol has a corresponding closing symbol and the pairs of parentheses are properly nested.Public Test Cases:# INPUT EXPECTED OUTPUT1 (())true2 ((false

4. The data structure required to check whether an expression contains a balanced parenthesis is?a) Queueb) Stackc) Treed) Array

5. The data structure required to check whether an expression contains balanced parenthesis is#(A) Stack(B) Queue(C) Tree(D) Array(E) LinkedList66. The complexity of searching an element from a set of n elements using Binary search algorithmis(A) O(n)#(B) O(log n)(C) O(n2)(D) O(n log n)(E) O(nlog2n)67. What data structure would you mostly likely see in a nonrecursive implementation of a recursivealgorithm?#(A) Stack(B) Linked list(C) Queue(D) Trees(E) Array68. The process of accessing data stored in a serial access memory is similar to manipulating dataon a(A) linkedlist(B) queue#(C) stack(D) array(E)heap69. A linear collection of data elements where the linear node is given by means of pointer is called#(A) linked list(B) node list(C) primitive list(D) None of these(E)pointer list70. Representation of data structure in memory is known as:(A) recursive#(B) abstract data type(C) storage structure(D) file structure(E)linear structure71. If the address of A[1][1] and A[2][1] are 1000 and 1010 respectively and each element occupies2 bytes then the array has been stored in _________ order.#(A) row major