You have the job of designing an algorithm that counts the number of objects with holes and the number of objects without holes in images of the kind shown below. 0 Assume that the images are binary with 0 corresponding to black and 1 corresponding to white. The imaging system is of low quality and produces images that are corrupted with salt and pepper noise. The objects do not overlap or touch, but may be close to each other in any direction. They may be of any shape or size. The algorithm should not be confused by the salt and pepper noise, and should not count noise pixels as objects. Write a description of the steps that your algorithm will use. The algorithm should be expressed as follows: Step 1: Elimiate the noise using RE Step 2: Apply the xxx filter in order to XXXX And so on. Hint. The object counting technique seen in class works only for objects without holes. Think of a way where row by row labeling technique could be employed to figure out how many objects and how many holes are in the image