9. A train with n cars arrives to sector A of the train tracks. See Figure 3. Next to this segment of the trails there is a switch (See Figure 2 that connects to segments L and R (See 3). Each car in the train has a unique number. Your goal is to rearrange the order of the cars so the cars are in increasing order of these numbers. The first car has the smallest number, etc. Each car is allowed to pass the switch only O(log n) times. Your pseudo-code could include commands like 'drive a car from segment A to segment R.' Do not worry about how cars move - if you want them to, they will. (they each have their own engine). You just need to tell them what to do. Train cars cannot leave the tracks, jump in front of other cars, or any other unrealistic behavior. For more on train switches see this Wikipedia Link. mamlak Ulm WIN10mm D|||||||||||| ITTTTTTTTTTT MTTTTTTTTTTTTTTTTTTTTTT ! TTTTTTTT TTTTTT Figure 2: Example of a standard railroad switch Section L(Left) Section A Section A Section R(Right) 9. A train with n cars arrives to sector A of the train tracks. See Figure 3. Next to this segment of the trails there is a switch (See Figure 2 that connects to segments L and R (See 3). Each car in the train has a unique number. Your goal is to rearrange the order of the cars so the cars are in increasing order of these numbers. The first car has the smallest number, etc. Each car is allowed to pass the switch only O(log n) times. Your pseudo-code could include commands like 'drive a car from segment A to segment R.' Do not worry about how cars move - if you want them to, they will. (they each have their own engine). You just need to tell them what to do. Train cars cannot leave the tracks, jump in front of other cars, or any other unrealistic behavior. For more on train switches see this Wikipedia Link. mamlak Ulm WIN10mm D|||||||||||| ITTTTTTTTTTT MTTTTTTTTTTTTTTTTTTTTTT ! TTTTTTTT TTTTTT Figure 2: Example of a standard railroad switch Section L(Left) Section A Section A Section R(Right)