Write a recursive procedure to draw a line segment between (x 0 , y 0 ) and (x 1 , y 1 ) on a screen of pixels with integer coordinates. (Hint: The pixel closest to the midpoint is not far off the...

Write a recursive procedure to draw a line segment between (x₀, y₀) and (x₁, y₁) on a screen of pixels with integer coordinates. (Hint: The pixel closest to the midpoint is not far off the line segment.)

One day you notice that integer multiplication no longer works. Write a recursive procedure to multiply two values a and b using only addition. What is the complexity of this function?