Bresenham's Line Drawing Algorithm

Write a C program that implements Bresenham's line algorithm for the first octant (0 <= slope <= 1).

Requirements:

• Implement the algorithm for a line from (x0, y0) to (x1, y1) where x1 > x0 and y1 >= y0 and (y1-y0) <= (x1-x0)
• Use only integer arithmetic: no floats, no division in the loop
• Plot each pixel coordinate on stdout in the format "(x, y)"
• Calculate and print the total number of pixels drawn
• Verify that the number of pixels equals (x1 - x0 + 1)
• Test with the line from (2, 3) to (12, 7)
• Also test with a horizontal line (5, 5) to (15, 5) and a 45-degree line (0, 0) to (8, 8)
• Print the decision variable (error term) at each step to show how it evolves
• Include a brief explanation of why floating-point is avoided