Question 22: Random selection operation of a component is implemented efficiently if the storage representation of the data object is sequential. a) True. b) False. Question 23: Dynamic data types are implemented using a heap based on the operations: Get storage - allocate(x) free storage - free(x) Problem: Dangling and garbage are occurred when we use the code: a) allocate (x); x=y; free(x). b) allocate (x); allocate(x). c) a and b respectively. d) b and a respectively. e) none of the mentioned. am Question 24: A referencing operation is defined as an operation with an identifier and a referencing environment as parameters and returns a data object or a code of a subprogram. a) True. b) False. Question 25: Assuming static scope, the non local referencing environment at statement1 and statement2 for the following program segment are: Main Var X, Y, Z: real procedure MI( X: real); Var D: real begin MI; call N2 (Y); statement end MI; procedure N2( C real); team Var D, B: real; begin N2; statement end N2, begin main; call MI(A): end main a) At statement1: Main; M1;N2; Y;Z At Statement2 Main;M1; N2;X;Y;Z. b) At statement1: Main; M1; N2;Y;Z. At statement2 N2;M1;X. c) a and b. d) At Statement1: N2;X; B. At statement2: N2; main;Z. e) None of the mentioned