Experiment by running multiple instances of the program in Listing 55-1 (t_flock.c) to determine the following points about the operation of flock():
a) Can a series of processes acquiring shared locks on a file starve a process attempting to place an exclusive lock on the file?
b) Suppose that a file is locked exclusively, and other processes are waiting to place both shared and exclusive locks on the file. When the first lock is released, are there any rules determining which process is next granted a lock? For example, do shared locks have priority over exclusive locks or vice versa? Are locks granted in FIFO order?
c) If you have access to some other UNIX implementation that provides flock(), try to determine the rules on that implementation.