The following is a sample of relations for a course enrolment database in a college:

Student (StudentID, Student_first name, Student_last name, Major, Registered year)

Course (CourseID, Course_title, Course_unit, StaffID)

Staff (StaffID, Staff_first name, Staff_last name, DeptID)

Enrolment (EnrolID, CourseID, StudentID, maximum_no)

Each course is limited to only 20 students per enrolment

1) Based on the above relations, create one transaction when a student wants to enroll in a course (MAA201 (Mathematic), 4 units)

2) Assume another student also wants to enroll in the same course and you are required to create another transaction for this purpose.

(i) Produce a serial schedule by combining transactions that you have created in q1 and q2.

(ii) Produce a non-serial concurrent schedule with interleaved operations based on the schedule that you have created in q2.

(iii) Test the schedule in q2(ii) whether it is serializable or not. If it is serializable, state the equivalent serial schedule.