A$.$ An RGB color image analog phone channel with dimensions of $1000\backslash$times $1000$ pixels and $256$ levels of a color product

$57600$ bits per second rules are sent using the modem. There is a starting point when filling the color information of each pixel.

Assume that the bit and a stop bit are added. First find how many bits are generated for this color image, then

Calculate how many images can be sent. To cut this image, increase the data transfer.

What can be done to minimize the time?

b$..$ For intensity setting V$=\{0,1\},$ a connected image is created using m$-$contiguity in the image region given in the figure on the right.

Find it inside $($circle the pixels of the connected parts$).$ D$4$units of lengths spread over a city $($city$-$block$)$

Using these connected products, calculate the longest length of operations $($lengths of consecutive pixels$)$

total$).$