For this project, I must parallelize the Floyd-Steinberg algorithm using POSIX Pthreads. This code must be written in either C or C++. Must be able to test this code using 1,2,3,4,5,6,7, and 8 threads.

II. REQUIREMENTS Implement the parallel strategy above using POSIX Pthreads. Your program should accept two command arguments, the name of the image to be processed, and the (maximum) number t of threads to be created. You will then open the input image and create the specified number of threads. Since there will generally be more rows in the image than threads, each thread i i will process rows i, i max. i 2tmax, t. You can implement this without the need for explicit synchronization primitives. It is sufficient to create an array of t integers, one for each thread. Each pixel of the image is assigned a unique integer max value, starting with the values of the first row, then the second row, etc. Each thread will write the number of the current pixel into its element of the array. Thread i canthen determine whether a pixel can be processed by evaluating the value in thread i 1's array element. II. REQUIREMENTS Implement the parallel strategy above using POSIX Pthreads. Your program should accept two command arguments, the name of the image to be processed, and the (maximum) number t of threads to be created. You will then open the input image and create the specified number of threads. Since there will generally be more rows in the image than threads, each thread i i will process rows i, i max. i 2tmax, t. You can implement this without the need for explicit synchronization primitives. It is sufficient to create an array of t integers, one for each thread. Each pixel of the image is assigned a unique integer max value, starting with the values of the first row, then the second row, etc. Each thread will write the number of the current pixel into its element of the array. Thread i canthen determine whether a pixel can be processed by evaluating the value in thread i 1's array element