Q1: Draw a process tree (as in Figure 1) to illustrate parent-child relationship for the C code given in program 2. For each node on the tree, write the following information: i The process identifier (assumed that the parent process identifier is assigned with an integer 21). The return value of the fork() statement Generated output 111. #include #include main() { int pidl, pid2, pid3; pidl=fork(); if (pidl == 0) else { printf("\n I love \n"); printf("\n Operating system\n"); pid2-fork(); if (pid2 == 0) else { } printf("\n difficult \n"); pid3=fark.): printf("\n but interesting!!\n"); RE"\n class, \n"); Program 2: Generation of child process

OZ PROGRAMMING LANGUAGE    Exercise 1. (Efficient Recurrence Relations Calculation) At slide 54 of Lecture 10, we have seen aconcurrent implementation of classical Fibonacci recurrence. This is: fun {Fib X} if X==0 then 0 elseif X==1 then 1 else thread {Fib X-1} end + {Fib X-2} end end By calling Fib for actual parameter value 6, we get the following execution containing several calls ofthe same actual parameters.For example, F3, that stands for {Fib 3}, is calculated independently three times (although it providesthe same value every time). Write an efficient Oz implementation that is doing a function call for a givenactual parameter only once.Consider a more general recurrence relation, e.g.:F0, F1, ..., Fm-1 are known as initial values.Fn = g(Fn-1, ..., Fn-m), for any n ≥ m.For example, Fibonacci recurrence has m=2, g(x, y) = x+y, F0=F1=1

1 Write a C++ code using a while statement to compute the average of all alternative nodes (1st, 3rd, 5th ...) in the given linked list where the first node is pointed to by first. NOTE: Each node has data member that stores the data and the next member that stores the address of the next node. ( means; there are any number of nodes) Use the following declaration: first Node* next; struct Node { }; int data; double total = double average; Node* temp = first; int count 0; = 0;

Write the report of this course that is the explanation of the algorithm in this program #include<iostream> // include necessary libraries #include<stack> // include necessary libraries #include<locale> // include necessary libraries #include <climits> // include necessary libraries using namespace std; int preced(char ch) {   // defining precedence function if(ch == '+' || ch == '-') {  // if condition return 1;}else if(ch == '*' || ch == '/') {return 2;}else {return 0;}} string inToPost(string infix ) {  // defining push function  stack<char> stk;stk.push('#');   string postfix = "";   string::iterator it; for(it = infix.begin(); it!=infix.end(); it++) { // for loop if(isalnum(char(*it)))  // if condition postfix += *it;else if(*it == '(') // if condition stk.push('(');else if(*it == ')') { // if condition while(stk.top() != '#' && stk.top() != '(') {postfix += stk.top();  stk.pop(); // pop element }stk.pop();   }else {if(preced(*it) >…