Modify the bakery algorithm to solve the k-mutual exclusion problem, in which at most k processes can be in the critical section concurrently.

Modify the java code in Java. It must compile using Java 18 or 19. It may or may not run correctly, I am looking for clear java code and extraordinarily good commenting on the existing code along with your modifications.