determine whether the schedule is conflict serializable by using a precedence graph. if the schedule is conflict serializable, please give an equivalent serial schedule. suppose that each transaction starts immediately before executing the first instruction and commits immediately after executing the last instruction. assume that the initial values of a, b, c and d in the database are 100, 200, 300 and 400, respectively. show the content of the database log for the execution following the schedule that would be suitable for data recovery. suppose that the log-based immediate-update technique is employed. describe the recovery process when a system crash occurs at time
