An old bridge serves the passage of the cars of the inhabitants of the area between its two ends (L) and (R). The passage of a vehicle from the bridge is possible in both possible directions. Specifically, a vehicle can cross the bridge in the right direction (L) to the end (L) to the edge (R), as well as in the left direction (Left Direction) moving from the edge (R) to the end (L). Due to the age of the bridge, it is not possible to cross it in both directions at the same time. In addition, it is not allowed to cross the bridge at the same time (always in the same direction)
more than three vehicles. Model the above problem in the Python programming environment by avoiding the emergence of starvation conditions between processes that simulate the passage of vehicles across the bridge.