Detailed Instructions on Processes Layout (14 points): 1) Write a program to answer this problem using only one process. 2) Write a program to answer this problem using multiple processes where each process spawns at most one process. (Like DFS). 3) Write a program to answer this problem using multiple processes where the first process spawns a fixed number of processes, say X, and they (the children) spawn their own X multiple processes each, and so on and so forth. 4) Ensure that in all cases you are using the appropriate system calls for InterProcess Communication (IPC) and for making the processes collaborate harmoniously, terminate gracefully, and without zombies 5) Your ultimate goal should be to produce such a hierarchy of processes (process tree) that produces the final result faster. Can you fine-tune the size of variable X to do that? Or are the preceding configurations the clear winners? Consider lists of increasing sizes. 6) Can you create an arbitrary number of processes or are there any limitations? If you find limitations in your version of Linux OS, please show (e. g. via a printscreen or a file) what are your exact limitations in increasing the number of processes you will be generating. Why is this so?

Selective is defined as paying attention to messages that are consistent with one’s attitudes and beliefs and ignoring messages that are inconsistent.

Develop the program incrementally: a) start by reading and displaying each line of the input file to make sure you are reading the data set correctly. b) use the split string method to extract information from each line into a list. print the list to prove that this step is working correctly. d) convert the exam scores to type int and calculate the student’s average. display those items to prove this step is working correctly. e) create a tuple containing the six items for each student (name, exam scores, exam mean). display the tuples to prove this step is working correctly. (optionally, you may want to have the exam scores in a list so your tuple is (name, scores_list, f) append each tuple to a list. display the list to prove this step is working correctly. g) use the sort list method to re-order the tuples in the list. display the list to prove this step is working correctly. h) use a for statement to display the contents of the list as a table (with appropriate formatting). i) use a for statement to calculate the average of all scores on exam #1, then display the results. note that you could have calculated this average within the first loop, but we are explicitly requiring you to do this calculation by looping though your list of tuples. j) add the logic to calculate the average of all scores on exam #2, then display the results.

Suppose a router has built up the routing table shown in the table. subnet number 128.96.39.00 28.96.39.128 128.96.40.00 192.4.153.0 default) subnet mask 255.255.255.128 255.255.255.128 255.255.255.128 255.255.255.192 nexthop interface 0 interface 1 r2 r3 r4. the router can deliver packets directly over interfaces 0 and 1, or it can forward packets to routers r2, r3, or r4. describe what the router does with a packet addressed to each of the following destinations: (a) 128.96.39.10 (b) 128.96.40.12 (c) 128.96.40.151 (d) 192.4.153.17 (e) 192.4.153.90