Using the symbolization key U: the set of all animals xSy "x is Scared of y" translate the following assertions into the notation of First-Order Logic: L: the set of all large animals D: the set of all dangerous animals F: the set of all cute animals C: the set of all cats (a) Either some cat is cute, but not large, or every large dangerous animal is a cute cat. (b) If there exists a cute cat that is scared of a dangerous animal then there exists a large cat that every dangerous animal is scared of. (4 pts) Using the same symbolization key, translate the following into English: (a) ce CNF, Vx eLnD, cSx. (b) (c C, Ex E D, cSx) = (c LC FC, Vz D, (ySz zSc))