In a particular iteration of the Simulation-Based DTA solution process, the lime-varying link travel times simulated by a mesoscopic traffic simulator for a single-OD network are shown in the graph below a. Compute the experienced travel times for all three routes for users who depart the origin (Node 1) in time interval 2, and determine the time-dependent shortest path b. The path assignmentsng the three routes in this SBDTA iteration tor time interval 2 are: Route 1-2-4-6 Route 1-2-5-0 Route 1-3-5-6 Compute the total gap and the relative gap for time 10 users 12 users 16 users interval 2 in this SBDTA iteration Are we far away from or getting closc to thc Dynamic User Lquilibrium? In a particular iteration of the Simulation-Based DTA solution process, the lime-varying link travel times simulated by a mesoscopic traffic simulator for a single-OD network are shown in the graph below a. Compute the experienced travel times for all three routes for users who depart the origin (Node 1) in time interval 2, and determine the time-dependent shortest path b. The path assignmentsng the three routes in this SBDTA iteration tor time interval 2 are: Route 1-2-4-6 Route 1-2-5-0 Route 1-3-5-6 Compute the total gap and the relative gap for time 10 users 12 users 16 users interval 2 in this SBDTA iteration Are we far away from or getting closc to thc Dynamic User Lquilibrium