Problem statement

concurrent_reader_writer.txt

Q> a reader exists and a writer exists. the reader can read from 5 buckets. the writer can write to said 5 buckets. How would you solve
this problem in a manner that would allow the reader and writer to access buckets with minimum blocking time and no busy waiting.

Terms:
concurrency : allowing two processes or threads to access shared data simultaneously, issues to handle deadlock and data inconsistency.
deadlock: when a dependancy causes the processes that want to access data to wait for infinite time.
data inconsistency : when two processes access and change data the order of access causes one or both processes to get old data.

Hint : 
read about threads, mutexes, and conditional_variables in c++.

Hint 2 : think of buckets as an entity (object) with its own behaviour and state.