CHECKPOINT I1.1 1. What is the first mapping rule? 2. why is tr good to t maprong entitis and then map the weai entities? hat would you map after you map the weak entities? 3. W 4. How would you map weak entities of weak entities? 5. While mapping a binary 1:N relationship when the N side has full participation, why do we include the key of the 1 side of the table in the N side of the table? What would be wrong if we included the key of the N side of the table in the 1 side of the table? 6. Why would it be reasonable to map a l:N binary relationship that has partial participation on the N side like an M:N relationship