Mаrk True оr Fаlse fоr eаch statement belоw. 1. The Dining Philosophers problem is used to demonstrate the pattern of circular deadlock in concurrent programming. [1] 2. In the Producer-Consumer problem, data is persistent and can be read multiple times and rewritten when necessary. [2] 3. In the Producer-Consumer problem, multiple producers and consumers should be able to access the buffer concurrently. [3] 4. The Readers-Writers problem deals with concurrent access to a bounded buffer where data is consumed as soon as it is read. [4] 5. In the Producer-Consumer problem, semaphores can be used to prevent corrupt shared variables and avoid race conditions. [5]