(d) Draw the binary min heap that results from inserting 12, 9, 14, 16, 4, 17, 6, 8, 2 in that order into an initially empty binary heap. Draw the final tree. (10%)

(d) Consider a system consisting of 11 resources of the same type, being shared by n processes. Each process may need at most 3 of these resources at the same time. What is the maximum value of n that keeps the system deadlock free? Explain your answer to receive full credit. (7%)