Create a program using Pthreads. Each thread is to do the following computation: Each thread will receive an id value, such as 0, 1 or 2. For integer c in the interval [id*INC, (id+1)*INC) the thread is to determine the maximum number of times that the following releation is true: c2 = a2 + b2 where a and b are integers in the interval (0,c). The number of threads and the value of INC are to be specified via command line parameters. Each thread is to display its thread ID, the number of triplets found and the number of seconds it took to perform the computation. You are to run the program for 1 thread and INC set to 3000, and for 4 threads and INC set to 750. For example, with INC = 1000 and three threads, your output might look like this: id = 0, count = 1756, elapased time= 2 seconds id = 1, count = 2200, elapased time= 11 seconds id = 2, count = 2382, elapased time= 30 seconds All threads completed