I need the whole progress.

For a flight simulator game, three-dimensional analysis must be done. In one particular game, a passenger jet is taking off from the airport and flying on a path given by [x, y, z] = s[8,4,1], where s represents time in minutes and [x, y, z] is the position vector of the location of the plane in kilometers. A second jet is flying by the airport, waiting to land, and is on the path given by [x, y,z] = [60, -20, -20] + t[2,6, -1], where t represents time in minutes and [x, y, z] is the location on the path in km. 1. Assume that both jets continue on their paths. Will their paths meet? 2. If the paths do not meet, find the least distance between the paths. 3. If the paths do meet a) Find the location of the intersection of the paths. b) Make a correction to the path of the second jet by changing its direction vector to avoid the collision. c) Find the least distance between the paths after the correction