Example problem Write an algorithm in pseudo-code that will color all interior pixels of a triangle Assume boundary pixels have been set to BLACK (all other pixels are initialized to WHITE). The input to the algorithm is a seed point (u, v). which you may assume to be inside the triangle. You may use the setPixel (x, y) and getPixel (x, y) methods, where setPixel (color) sets a pixel to a supplied color, and getPixe1 () retuns the current color at that pixel. The algorithm must start at the seed point and color all pixels inside the triangle. Be careful not to let your algorithm "seep" outside of the BLACK triangle boundaries, and because of system constraints, your algorithm must use a stack (no recursive solutions)