write an algorithm on this

Date: bus a one we to way a bus Give solution for the problem of metro service in newyork. There is a where boses coming opposite directions cannot cross their means that that if enters from south then till the time it crosses the brige from north and the bridge is clear, no bus verse it may enter it has ever be allowed + and vice . Also, another south bus if another southbus is already using the bridge and vice versa. The traffic controller contacted you for you repute in concepts to give an aumpicable solution. Using your synchroniz ation knowledge, you are required to implement starvation frome solution, must to enter has , 4