The following attributes represent data about a copy of a movie at an online video rental service. Each movie is identified by a movie number and has a title and information about the director and the studio that produced the movie. Each movie has one or more characters, and there is exactly one actor playing the role of each of the characters in a movie but one actor can play multiple roles in each of the movies. The video rental service has multiple license types for the same movie (i.e., movie number does not determine license type), and to differentiate the different licenses for different copies of the same movie, the rental service assigns a licenses number to a copy of Saint Marys College, Notre Dame, IN Math 429 | Misiolek Page 2 of 5 CPSC 429 Homework Lab 3 Logical Design and Normalization (Ch.14) a movie, which is unique within a single movie but not unique between different movies. Each movie license has a rental status and license expiration date; in addition, each license has a type (Regular or HD). The rental price is the same for all licenses of the same type. The attributes for a movie copy are as follows: (Movie Nbr, Title, Director ID, Director Name, Studio ID, Studio Name, Studio Location, Studio CEO, Character, Actor ID, Name, License Nbr, License Type, Rental Price, Rental Status, License Expiration Date) A sample data set regarding one movie (one row of the relation with the attributes listed above) would be as follows (the data in the curly brackets are character/actor data, in this case for four different characters int the movie): <567, Its a Wonderful Life, 25, Frank Capra, 234, Liberty Films, Hollywood, CA, Orson Wells, {(George Bailey, 245, James Stewart), (Mary Bailey, 236, Donna Reed), (Clarence Oddbody, 765, Henry Travers), (Henry F. Potter, 325, Lionel Barrymore)}, 5434, HD, 3.95, Rented, 12/15/2015> Based on this information, a. (4 pts) Identify the semantically obvious functional dependencies between the attributes by using arcs on the vertical relation schema below. (15 pts) Go through the process of normalization to obtain a set of relations all in 3NF. Show your intermediate steps below. To make the process of writing your decompositions more convenient, rename the attributes as letter A P. Give semantically appropriate names to the relations in 3NF. Use ERDPlus to draw the final relational schema with all relations in 3NF; use the original attribute names and give semantically meaningful names to the relations. For each relation in the final schema specify the primary key and foreign key and make sure all the referential integrity constrains are marked as well.