Please answer the 4 multiple choice questions below:

If the initial thread of a multiply threaded process leaves the run state via the thread exit transition, the entire process will terminate. A timesharing thread in the run state may never be pre-empted by a ready thread of the same priority. Each byte of an individual memory object (i.e. TEXT. DATA, STACK, etc.) found in a process address space: Must be mapped to physically contiguous memory Can be read, but never written to Must occupy virtually contiguous locations Must always be mapped to physical RAM Variations of LRU page replacement algorithms are the most commonly used algorithms for page-purger threads in contemporary systems like Linux and Windows. If the initial thread of a multiply threaded process leaves the run state via the thread exit transition, the entire process will terminate. A timesharing thread in the run state may never be pre-empted by a ready thread of the same priority. Each byte of an individual memory object (i.e. TEXT. DATA, STACK, etc.) found in a process address space: Must be mapped to physically contiguous memory Can be read, but never written to Must occupy virtually contiguous locations Must always be mapped to physical RAM Variations of LRU page replacement algorithms are the most commonly used algorithms for page-purger threads in contemporary systems like Linux and Windows