I need this answer in 20 min. Please help me

Consider a relation R(StudentNo, StudentName, Program, CourseNo, CourseName, InstructorNo, InstructorName, InstructorLocation, Grade). In this relation, each student will have a unique StudentNo which is the primary key for this relation. One student may be enrolled to only one program but can be registered multiple courses, which results in having multiple values in a single column for some tuples. As a result, the relation R did not satisfy the minimum requirement to be in 1NF normal form. Answer the Question 1 based on the relation described above:

1. a. Decompose the relation R into two tables by separating the student information and course information so that it satisfies the requirement of 1NF normal form. Find the primary key for both tables. b. Analyse the tables created in Question 1, and check whether there is any partial dependency or not. If yes, decompose the tables to remove the partial dependency, so that the relation belongs to a 2NF normal form. c. Determine whether the table designed in Question 2 is in 3NF or not. If not, perform the necessary decomposition to make it into 3NF normalized form.

2. Consider a relation X(A, B, C, D, E) having the following functional dependencies: AB C, D, E D A Determine whether the relation is in BCNF or not. Justify your answer.

3. Consider the table provided in Figure 1 in appendix. Illustrate how dense index and sparse index can be created based on the last column of the table. Justify the necessity of sorting the tuples based on the last column while creating sparse index.

4. B+ tree is a widely used data structure for maintain indexing in database. Create a B+ tree based on the values of the last column of the table provided in Figure 1 in appendix. Insert the elements in the order of their appearance in the table.

5. Illustrate with a sample schedule, how deadlock and starvation can happen while allocating resources for transactions. Provide solutions for preventing deadlock.

6. Evaluate the necessity of maintaining ACID properties of a transaction with the help of an appropriate example.

Appendix The following table is used in Question 1, 3, and 4 10101 12121 15151 22222 32343 33456 45565 58583 76543 76766 83821 98345 Srinivasan Comp. Sci. Wu Finance Mozart Music Einstein Physics El Said History Gold Physics Katz Comp. Sci. Califieri History Singh Finance Crick Biology Brandt Comp. Sci. Kim Elec. Eng. 65000 90000 40000 95000 60000 87000 75000 62000 80000 72000 92000 80000