Passengers enter from a line at the ground floor (floor 0), and it holds a maximum of N passengers at any given time. When empty, it always returns to the ground floor and waits. Once the first passenger enters it at some time t, it waits for exactly x seconds before departing. If there are less than or equal M (<= M) or if the weight of passengers in the elevator is less than or equal to W (<= W), passengers can continue entering the elevator up to and including time t + x. > Traveling up or down between adjacent floors takes 1 second, and entering or exiting takes 0 seconds. Each time There is no order or priority in which Passengers enter and leave the elevator. elevator departs from the ground floor, a new trip begins. A trip ends once the elevator drops off all its passengers and returns to the ground floor. Each trip is numbered sequentially, starting with 1. Writing a program in C language to simulate the elevator's behavior. >