$[$True$/$False Question: $10\%]$ Please mark $\text{'}O\text{'}$ or $\text{'}x\text{'}$ to answer each question.

$(1)$ The average$-$case time complexity of selection sort is O$(nlgn.(1\%)$

$(2)$ LIFO and FIFO policies can be implemented by queues and stacks, respectively. $(1\%)$

$(3)$ A hash has no inverse functions. $(1\%)$

$(4)$ A red$-$black tree with $k$ internal nodes has height no more than $2lg(k-1).(1\%)$

$(5)$ A tree contains no cycles. $(1\%)$

$(6)$ Threads in the same process can directly share memory and common variables. $(1\%)$

$(7)$ In any case, a user process is prohibited to use kernel data structures. $(1\%)$

$(8)$ A hard real$-$time OS can be implemented by preemptive, priority$-$based scheduling. $(1\%)$

$(9)$ The wait$-$die scheme is a preemptive$-$based solution for deadlock prevention. $(1\%)$

$(10)$ Write$-$through policy is more reliable than write$-$back policy for caches. $(1\%)$