Consider the following segment of code:procedure Mvar x: integer;procedure A (c: integer)var a, b: integer;procedure Bvar b, c, d: integer;begin {B}….a := c – d;….end B;begin {A}….x := b + c;….B()….end A;begin {M}….A(3)….end M;Assuming the definition of M is at static nesting level 0. Draw the runtime stack that will be ineffect at the execution of “a := c – d;”. Show the static and dynamic links, and the currentpositions of the EP and SP pointers.What is the static distance to x’s environment of definition and the offset within the environmentwhen “a := c – d;” is executed?

Determine all the output from the following program as it would appear on the screen. void func1(int); void func2(int = 4, int = 5, int = 2); int func3(int &, int, int); %3D int main() { int x = 0, z = 0, y = 2; func1(y); cout << y << endl; func2(x, y, z); func2(); func3(x, y, z); = Z func1(x); cout << x << " " << y << " " << z << endl; return 0; } void func1(int b) { static int a;

The function ver() is defined as follows: void ver(char "pc) { char c; if( "pc == "\O' ) return; c = "pc; ++pc; ver(pc); putchar(c); Show the output when function ver() is called as follows: ver("recursion");

in c++ write a code to return the value of fake coin, the fake coin is The different element of the value in the array ،and need for way solution using 1) brute force approaches 2) divide and conquer 3) decrease and conquer 4) transform and conquer and write the time of each one and what the best time of them.   in c++ write a code to return the value of fake coin, the fake coin is The different element of the value in the array and be less value (minimum) , need four way solution using 1) brute force approaches   2)divide and conquer   3)decrease and conquer 4) transform and conquer   and write the time of each one and what the best time of them.