Write a program using pthreads, which calculates the sum of elements in a hard-coded integer array in parallel using 4 threads. The program must divide the work between 4 threads which run simultaneously. For simplicity, you can assume that the size of the array is 100. Note that the integer array must be declared as a global data structure. Initially code your solution so that the sum of elements is maintained in a global shared variable. Each thread modifies the same shared variable as it sums up elements from the array. Use a suitable synchronization primitive (mutex) to ensure safe access to the global variable. (A sample code of Mutex is attached for your reference)

Write a c++ code that implement a loop that accesses a number of different locations in an array over-and-over again, and see how the average access time changes as the array size increases, from a size small enough to fit in L1 cache to a size too large to fit in L2 (or L3) cache.  Try to estimate the sizes of your caches.

Which of the following statement or statements are true ? Please check all that apply.           Both the linkedlist and array size needs to be pre-decided         Arrays have better cache locality that can make them better in terms of performance.         It's easier to insert and delete elements from array than from the linkedlist         Data type of the linked list doesnot need to be same, whereas in array, it must be the same         memory can be allocated at runtime both for linkedlist and dynamic array Which of the following statements are true? Check all that applies 5 points         Accessing any element of an array has the time complexity of O(n)         Searching for an element in array and linkedlist has the same time complexity         Inserting or Deleting an element from a stack or queue has the same time complexity         Accessing an element from a singly…

Complete the following code. The goal is to implement the producer-consumer problem. You are expected to extend the provided C code to synchronize the thread operations consumer() and producer() such that an underflow and overflow of the queue is prevented. You are not allowed to change the code for implementing the queue operations, that is the code between lines 25 and 126 as shown in the screenshot. You must complete the missing parts as shown in the screenshot as well as complete the missing codes of producer and consumer.     #include <stdio.h> #include <stdlib.h> #include <unistd.h> #include <time.h> #include <pthread.h> #include <semaphore.h> #include <errno.h> #include <fcntl.h> #define MAX_LENGTH_CAP 100 #define INIT -127 #define UNDERFLOW (0x80 + 0x02) #define OVERFLOW 0x80 + 0x01 #define BADPTR (0x80 + 0x03) #define CONSUMER_TERMINATION_PROBABILITY 40 #define PRODUCER_TERMINATION_PROBABILITY 30 // ============= LOCKED…