Suppose a computer graphics screen has resolution 1024 768, that is, 1024 pixels (dots on screen) wide and 768 pixels high. Each pixel is has levels of red, green, and blue, where each value is between 0.0 and 1.0. Suppose 16 processes are available for parallel computation. Give an algorithm for a nearly embarrassingly parallel algorithm to add 0.05 to the red component up to a maximum of 1.0 for every pixel.