Question 1. (5*1 points) Determine either True or False for each of following statements as appropriate. No partial credit for this problem. a) The major goal of distributed computing is to solve a given problem faster, or equivalently to solve a larger problem in the same amount of time. b) The spin-lock solution to the critical section problem does not satisfy the eventual entry property if the scheduler is strongly fair. c) Parallel execution of a concurrent program can be modeled as a linear history, because the effect of executing a set of atomic actions in parallel is equivalent to executing them in some serial order. d) A delay condition B meets the at-most-once property if it contains zero or one critical reference. In this case, the evaluation of B appears to be atomic. e) The Ticket algorithm discussed in class requires strongly fair scheduler to ensure processes in a concurrent program to eventually enter their critical sections