Consider the universal relation schema INVENTORY (Store#, Item, Vendor, Date, Cost, Units, Manager, Price, Sale, Size, Color, Location) and the constraint set F {fd1, fd2, fd3, fd4, fd5, fd6, fd7} where:

fd1: {Item, Vendor} -> Cost

fd2: {Store#, Date} -> {Manager, Sale}

fd3: {Store#, Item, Date} -> Units

fd4: Manager -> Store#

fd5: Cost -> Price

fd6: Item -> {Size, Color}

fd7: Vendor -> Location

****NOTE I ALREADY ANSWERED PART A, I JUST NEED HELP ON B AND C; PUTTING PART A IN FOR REFERENCE*****

A. Do the functional dependencies shown constitute a minimal cover of F? If not, do they derive a minimal cover?

B. Derive the candidate key(s) of URS using the synthesis approach.

C. Derive the candidate key(s) of URS by using the decomposition approach.