1.How many serial schedules exist for the three transactions in Figure 17.8(a)?
What are they? What is the total number of possible schedules? 2. Write a program to create all possible schedules for the three transactions in Figure 17.8(a), and to determine which of those schedules are conflict serializable and which are not. For each conflict serializable schedule, your program should print the schedule and list all equivalent serial schedules.