The minimum distance is the shortest distance. We can find this using the distance formula. It is based off of the pythagorean theorem.
D = root( (x1-x2)^2 + (y1-y2)^2 )
A:(-3,1)
B:(1,2)
He drives from A -> B
root( (-3-1)^2 + (1-2)^2 )
root( 16 + 1 )
root(17)
The then drives halfway from b -> c
B:(1.2)
C:(5,0)
root( 4^2 + 2^2 )
root( 16 + 4 )
root(20) is the total distance
root(17) + root(20)/2 = 6.3591
Rounded to the nearest tenth is 6.4
