Consider the below schema of the university database (keys are in bold and underline): • Students(stuID: Integer, stuName: String, gender: String, age: Integer, gpa: Float) • Departments(deptName: String, numPhDs: Integer) • ProfessorWorks(profID: Integer, profName: String, deptName: String) • CoursesOffer(cNo: String, cTitle: String, deptName: String) • Majors(deptName: String, stuID: Integer, degreeProgram: String; attendYear: String, attendSemester: String) • Sections(cNo: String, academicYear: String, semester: String, sectNo: Integer, profID: Integer) • Enrolls(stuID: Integer, cNo: String, academicYear: String, semester: String, sectNo: Integer, grade: String) Write the following queries in Relational algebra. Turn in your work to the assignment link. 1. Print the name(s) and sid(s) of the student(s) enrolled in more than three classes in Fall 2016. 2. Print the age difference between the oldest and youngest student(s). 3. Print the age difference between the oldest and youngest student(s) per department. 4. Print the name(s) and GPA(s) of student(s) who major in B.S. in Information Technology in the Computer Technology department, attending the program after Fall 2015. Note that B.S. in Information Technology, Computer Technology, 2013, and Spring are a degree program, a department name, an attending year, and an attending semester, respectively. 5. Find the names of students who have not enrolled in any course yet Fall 2016.
Let X = (Qx, ∑, δx, q0, Fx) be AN NDFA that accepts the languageL(X). we've to style the same DFA Y = (Qy, ∑, δy, q0, Fy) such L(Y)= L(X). the subsequent procedure converts the NDFA to itsequivalent DFA −AlgorithmInput:   An NDFAOutput:   equivalent DFAStep 1   Create state table from the given NDFA.Step 2   Create a blank state table underneath potentialinput alphabets for the equivalent DFA.Step 3   Mark the beginning state of the DFA by q0 (Samebecause the NDFA).Step 4   Find out the mixture of States for everypotential input alphabet.Step 5   Each time we have a tendency to generate areplacement DFA state underneath the input alphabet columns, we'veto use step four once more, otherwise move to step vi.Step 6   The states that contain any of the ultimatestates of the NDFA square meas ... See the full answer