1. (a) How is this tree represented in the computer? As a Linked List or Array?

(b) (c) Which process is the winner of the race condition?

(d)

Will upvote guarantee if all of them are answered correctly!

- Create a BST for the following inputs ARR=[47,23,33,65,25,1,19,99,520,7,46,48] a) The process which is created first b) The process which is created last c) The slower process d) The faster process 27) Which of the following statement is not True about the deadlocks? a) There is no single effective strategy that can deal with all types of deadlock b) It is the temporary blocking of a set of processes processes It usually occurs when the processes compete for system resources or communicate with each other