1. Can the following sets of transactions run into a deadlock with the scheduler named in each subquestion? If your answer is Yes, give a schedule diagram that ends in a deadlock. If your answer is No, give a succinct explanation why not. (a) with the simple scheduler: TA2 : r2(x], r2[2], r2[y], c2 (6 marks)