There is another solution to Question 3 on Chegg, please don't post the same solution. Answer both of them please!

3. (30 pts) Write a program in C or C++, which simulates the generation of a set of k processes. Each process represented by a 3-tupel containing a unique process PID, the number of CPU-cycles required to complete the process, and the size of the memory footprint. The required number of cycles is chosen from the interval 1,000,11,000> with a mean of 6,000. While it is acceptable to distribute the required cycles uniformly, (I suggest that you attempt to implement a different distribution.) The memory footprints of processes fall in the range of 1KB to 100KB with a mean memory footprint of 20 KB. You need to represent the set of k processes with a data structure of your choice. Show how the values (required cycles and memory footprint) are distributed over your set of processes. You must submit your program, and a short description of your approach and the data structures used. 4. (20) Extend Peterson's SW-based MUTEX solution to work with n processes