Computers and Technology
Given an ordered integer array 'nums' of unique elements, write the pseudo code of a function to return all possible subsets (the power set). The solution set must not contain duplicate subsets. You should use the DFS algorithm. You can return the solution in any order. Example: nums = [1, 2, 3] Output : [[], [1], [2], [3],[1, 2], [1, 3), [2, 3],[1, 2, 3]]
Part II: additional problems 1, 2, and 3 listed below.For each problem:a. Identify the given table as 1NF, 2NF, 3NF, or UNF (contains repeating group).b. Identify all partial and transitive dependencies by drawing a dependency diagram(for a UNF table, transform it to 1NF, then draw the dependency diagram).c. Transform all tables into 3NF by following the steps below. For c, you do NOT haveto draw dependency diagrams.1. STUDENT (STUDENT SSN, ST_NAME, MAJOR, ADVISOR NUM, ADV_NAME,ADV OFFICE. ADV PHONE ST CREDITHRS, CLASS STANDING)where:STUDENT SSN- All other attributesADVISOR NUM ADV_NAME, ADV OFFICE, ADV PHONEST CREDIT HRS > CLASS STANDINGNote: XYZ > ORS means that XYZ determines ORSYou can also find this notation in figure 6.3 and definition of determination on page62.2. MOVIE (MOVIE NUM, MOVIE TITLE, STAR NUM, STAR NAME)Sample data: (You can determine primary key based on the sample data.)MOVIE NUMMOVIE TITLESTAR NUMI STAR NAMEM001The MummyS001Brendan FraserS002Rachel WeiszM002CrashS001Brendan FraserS003Sandra Bullock(You may notice one movie can feature many stars and one star can act in many movies.)3. MOVIE (MOVIE NUM, MOVIE TITLE, DIRECTOR NUM, DIR NAME)where:MOVIE NUM> MOVIE TITLE, DIRECTOR NUM, DIR NAMEDIRECTOR_NUM >DIR NAME