Consider Procedure N2( C: real); Var D, B: real; begin N2; statement end N2; The compilation of N2 will generate a. The static part of the runtime representation of N2 that contains only the code respective to its body, b. The static part and the dynamic part of the run time representation of N2 c. The static part of the runtime repsentation of N2 that contains code respective to its body d. The static part of the runtime representation of N2 that contains the constants and a code for alloctior and deallocation of the dynamic part of its runtime representation e. d and c Consider the following statement in C++ Y = 20 + Z All possible types and all possible values of Y and Z are determined at: O a. Compilation time and execution time respectively. @b. Definition time and implementation time respectively, c. Compilation time and implementation time respectively. od. Implementation time and compilation time respectively e Execution time and compition time respectively Clear my choice Major storage for ML, LISP and Prolog is a heap. Get storage - allocate(x) free storage - free(x) Problem: Dangling and garbage are occurred when we use the code O a allocate (x); x=y: treech O b. allocate(x), allocate(x) O c. a and b respectively O db and a respectively e, none of the mentioned o e. gande Java is implemented based on O a. The use of hardware interpreter of O b. The use of software interpreter O c. The use of firmware interpreter d. a orc O e. a ando a Consider the loop Repeat Body Until (condition); and two suggested implementations: (1) and (2) (1) -LO: code for condition (2) - LO: code for body Jump false L1 code for condition code for Body Jump LO LI: JU LI: a implementation (1) is the correct one b. implementation (2) is the correct one c. implementation (2) is the correct one it Jump LO is replaced by Jump true to d. Implementation (1) is the correct one it Jump LO is replaced by Jump false LO e. Implementation (2) is the correct one if Jump LO is roplaced by Jump false to