OPERATING SYSTEM_______ C language

You have to solve a variation of the readers-writers problem, in which multiple writers can write at the same time. Specifically, there are readers and writers. Up to 5 reads at the same time are allowed, but only one write at the same time are allowed. A read and write at the same time is not allowed. Provide a solution using semaphores with the following properties:

no busy waiting

starvation-free (i.e. a continuous stream of readers does not starve writers, and vice versa) is desirable but not compulsory (but you will lose some points)

you cannot use process ids and you cannot have a separate semaphore for every process.