Consider the relation schema R = (N, Y, P, M, C) and assume that the following set of functional dependencies hold on R: F = { N M, NY P, M C} The letters can be interpreted as follows: R = (Model_Number, Year, Price, Manufacturing_Plant, Color).

1. Evaluate each of the following as a candidate key for R, giving reasons why it can or cannot be a key: N, NY, NC

2. Show that F is already in canonical cover form.