1. Creates a new Queue.
    2. Initialises 2 semaphores, namely mutex and wrt. "mutex" is used for keeping track of the no, of readers, whereas "wrt" can be regarded as lock on the queue.
    3. Pthreads are then created according to the user input.

    1. The reader first tries to get "mutex" via "sem_wait", in order to tell that first reader has arrived.
    2. If it gets it, the readercount is incremented by that process only.
    3. If the process is the first process to read from the shared queue, then "wrt" semaphore is also acquired so as to prevent the writers from updating the contents of the queue at that time.
    4. Reader menu provides (based upon the choice of the user):
            i) Printing entire queue elements, except the current written one. (Call to the PrintPrevQ() function).
            ii) Printing an element based upon the index entered by the user, except the current written one. (1-based indexing is followed, Call to the PrintQElement() functiom).
            iii) Reader can quit anytime.
    5. "sem_post" on "mutex" allows other reader process to read from the queue.
    6. Again the "mutex" is acquired so as to now decrement the readercount.
    7. If no readers are left, "wrt" lock on the shared queue is lifted to allow writers to write.
    8. Lock on "mutex" is also lifted as no readers are left now.
    9. Above procedure also maitains atomicity among the readers.

    1. First the lock on "wrt" is acquired, signalling that a writer process has arrived and only 1 writer at a time can do the updation.
    2. Writer menu provides (based upon the choice of the user):
            i) Proper message is received from the user and enQueue() function is called.
            ii) Writer can quit anytime.
    3. Lock on "wrt" is lifted, signalling that now the lock on shared queue can be acquired by other writer processes.

    Prints the contents of the shared queue, except the last written one. (Performs reading)

    Enqueues a new message by a writer into the shared queue.

    Prints all the contents of the shared queue.

    Prints an element from the queue based upon its index.

    1. make
    2. ./rw

    If argument provided by the user is
            1. Not a number
            2. A number < 1 or > 100 (when providing No. of reader/writers)

    If the message provided by the user is newline.

    If the index entered while seeking a message at a specific index in the shared queue is < 1 or > the queue size.

    If the index entered while seeking a message at a specific index in the shared queue is equal to the queue size since seeking current written elements is not allowed.

    If the choice entered is not what is expected.