Computer Graphics Course:

Given $3$ points A$(3,8),$ B$(5,3)$ and C$(7,8).$

If point A is the starting point and point C is the ending point, then draw a line connecting them using the algorithm:

$1.$ Brute Force

$2.$ Digital Differential Analyzer

$3.$ Bressenham

Complete the $3$ algorithms along with the steps and images $($graphic$).$

Note: Since there are $3$ points to be solved, the steps from point A to C are A to B$,$ B to C$,$ and C to A$.$