Implement in Java, not C++. Suppose that in a kitchen there is only one four-burner stove to be used for both pans and clay pots. So that there are no problems, some rules have been imposed: - There cannot be clay pots and pans on a stove top at the same time - There cannot be more than three pans on the stove at the same time Using traffic lights, create a program that simulates the use of stovetops in an environment with N frying pans and M clay pots (N and M can be the same or different), so there is no starvation and/or deadlock. Print the number of pans or pans on the stove each time their value is updated (each time the quantity changes) Example: The hob has 1 frying pan. The hob has 2 pans. The stove burner has 1 pan. The hob has 2 pans. It must be implemented in Java not C++.