Recall the setup from the previous HW. There are n cars on a one-way circular track. Among all of them, they have exactly enough fuel (in total) for one car to exactly circle the track. Each car burns CS 70, Spring 2020, HW 2 3 exactly the same amount of fuel per unit of distance. Two cars at the same location may transfer fuel between them. (a) Prove that there exists one car that can circle the track, by gathering fuel from other cars along the way. (That is, one car moving and all others stopped). Hint: Use induction and the previous part of this problem from HW1.