Suppose there is a straight line that goes from $(10,-10)$ to $(15,-19).$ Use the

midpoint line drawing algorithm to calculate all the intermediary pixel coordinates.

Use eightway symmetry if necessary. Show the values of $x,y,d,$ chosen neighbor,

real coordinate in tabular form.

In class, we have derived the midpoint line algorithm that exclusively works for

zone $0.$ Now, using the knowledge gained in class, derive the algorithm again but

this time exclusively for the zone you calculated in question $($a$).$ So that we

don't need to rely on eightway symmetry anymore. Mainly, you need to find the

formula for $d_{\text{i}\text{n}\text{i}\text{t}\text{,}},$ which neighbor we choose when the value of $d$ is positive or

negative, and the formula to update the value of $d($for both cases$).$

Draw the flowchart of the version of the algorithm you derived in question $($b$).$

$[$For sanity check that your new algorithm is working, you can recalculate the

pixels for the line given in question $($a$)$ and cross check, given that your question

$($a$)\text{'}$s answer was correct $($Optional$)]$