In this problem, you are given two different database transaction logs (each line represents a unique time of execution), each of which contains a set of transactions (consisting of READ and WRITE statements on objects). For each transaction log, several different interleaving between the transactions exist. a) Convert each transaction log into a transaction schedule. b) show how to apply strict2PL algorithm on each one if it is possible. 1. Transaction log at CO.#1 12:00 am II: READ A 12:01am T2: READ A 12:02am II: READ B 12:03am Tl: WRITE C 12:04am T2: WRITE B 12:05am Il: COMMIT 12:06am T2: WRITE A 12:07 am T2: COMMIT 2. Transaction log at Co.#2: 12:01pm T1: READ A 12:02pm T2: READ A 12:03pm T3: READ A 12:04pm T2: WRITE B 12:05pm T2: COMMIT 12:06pm T3: WRITE A 12:07 pm T3: COMMIT 12:08pm II: WRITE A 12:09pm T1: COMMIT In this problem, you are given two different database transaction logs (each line represents a unique time of execution), each of which contains a set of transactions (consisting of READ and WRITE statements on objects). For each transaction log, several different interleaving between the transactions exist. a) Convert each transaction log into a transaction schedule. b) show how to apply strict2PL algorithm on each one if it is possible. 1. Transaction log at CO.#1 12:00 am II: READ A 12:01am T2: READ A 12:02am II: READ B 12:03am Tl: WRITE C 12:04am T2: WRITE B 12:05am Il: COMMIT 12:06am T2: WRITE A 12:07 am T2: COMMIT 2. Transaction log at Co.#2: 12:01pm T1: READ A 12:02pm T2: READ A 12:03pm T3: READ A 12:04pm T2: WRITE B 12:05pm T2: COMMIT 12:06pm T3: WRITE A 12:07 pm T3: COMMIT 12:08pm II: WRITE A 12:09pm T1: COMMIT