Write a c/c++ code that implements the following: 1- USING LINUX/UNIX

2-USING PTHREAD LIBRARY

3-YOU MUST KNOW HOW TO DEAL WITH THREADS (CREATE,DESTROYAND SYNCING)

THE CODE IS ABOUT A 2D MEDIAN FILTER SIMPLY GET THE NEIGHBORS OF AN ELEMENT AND SORT THEM THEN REPLACE THE ORIGINAL ELEMENT WITH THE MIDDLE ELEMENT AFTER SORTING.

IN OUR EXAMPLE IT WILL BE THE ELEMENT WITH INDEX = 4 AFTER SORTING. THE WINDOW SIZE IS 9 (THE NEIGHBORS + THE ELEMENT) HERE IS AN EXAMPLE BELOW For pixels in the boundaries where they are missing some neighbors, we can assume the value Zero for these neighbors when calculating the median. NOW THE MAIN PART IS USING THREADS BUT WITH THE FOLLOWING CONDITION 1- NUM_OF_THREADS

2- N % NUM_OF_THREADS != 0 3- YOU MUST DO LOAD BALANCING AS MUCH AS POSSIBLE (THIS IS TOO IMPORTANT)

FOR EXAMPLE IF N = 5 (SO THE NUM OF ELEMENTS WILL BE 5*5 = 25) AND NUM_OF_THREADS = 3 EACH THREAD WILL WORK IN A RANGE OF ELEMENTS(PIXELS).

1- WITH LOAD BALANCING THREAD 0 WILL WORK IN ELEMENTS(PIXELS) FROM 0 TO 9 AND APPLY THE MEDIAN FILTER FOR THESE PIXELS THREAD 1 WILL WORK IN ELEMENTS(PIXELS) FROM 9 TO 17 AND APPLY THE MEDIAN FILTER FOR THESE PIXELS THREAD 2 WILL WORK IN ELEMENTS(PIXELS) FROM 17 TO 25 AND APPLY THE MEDIAN FILTER FOR THESE PIXELS THE ABOVE EXAMPLE ACHIEVED LOAD BALANCING SO THAT EACH THREAD WILL WORK APPROXIMATELY THE SAME NUMBER OF PIXELS

2- WITHOUT LOAD BALANCING THREAD 0 WILL WORK IN ELEMENTS(PIXELS) FROM 0 TO 15 THREAD 1 WILL WORK IN ELEMENTS(PIXELS) FROM 15 TO 23 THREAD 2 WILL WORK IN ELEMENTS(PIXELS) FROM 23 TO 25

TRY YOUR CODE WITH N = 17 AND NUM_OF_THREADS = 15 USING LINUX/UNIX THANKS IN ADVANCE.

N.B. Each template takes the values its sorts from the original image