Consider two trains moving in opposite directions on the same track. the trains start simultaneously from two towns, aville and bville, separated by a distance d. each train travels toward each other with constant speed v. a bee is initially located in front of the train in aville. as the train departs aville, the bee travels with speed u > v along the track towards bville. when it encounters the second train, it instantaneously reverses direction until it encounters the first train, then it reverses again, etc. the bee continues flying between the two trains until it is crushed between the trains impacting each other. the purpose of this problem is to compute the total distance flown by the bee until it is crushed. assume that the bee is faster than the trains. there are at least two good ways to solve this problem. one is to compute the distance for each flight leg and sum the resulting series. there is also another way to solve the problem with very little calculation. you are to do it both ways. (a) (10 points) find an expression for the distance dn covered by the bee after its nth encounter with a train. define d0 as the distance traveled during the first flight from aville towards the train near bville, d1 the distance traveled by the bee during the first trip from the bville train to the aville train, etc. sum the resulting series to get the final answer. (b) (5 points) devise another way to obtain the same answer using very little calculation