As an operations research scientist at Tesla, you need to solve a scheduling problem regarding na autonomous vehicles. The problem is as follows: vehicle i (i {1,2,. n}) must arrive at the Palo Alto headquarters within its specified time interval [tminx tmax), and the vehicles need to arrive sequentially (ie, in the order of 1,2,...,1). To avoid congestion, you want to find the optimal arrival time for each vehicle such that the narrowest inter-arrival time between two consecutive vehicles is the greatest. Formulate a linear program to solve this