[60 Points] A company database contains information about Managers (identified by m_id) and Projects (identified by p_no). Managers manage projects. You will be given some situations concerning the manage relationship set. For each situation, draw an ER diagram for it using the notation taught in our class (assuming no further constrains hold). a. Managers can manage the same project in different calendar years, and each year must be recorded. b. Managers can manage the same project in several calendar years, and only the current year needs to be recorded. c. Every manager must manage some project. d. Every project is managed by exactly one manager. e. Every manager manages exactly one project, and every project must be managed by at least one manager. f. Suppose some projects can be jointly managed by a group of managers. You can introduce additional entity sets and relationship sets if necessary. (Here, we assume that only the latest calendar year of a project needs to be recorded.) [20 Points] A university database needs to store information about professors (identified by p_id, with title, office, and phone as attributes), departments (identified by d_id, with d_name, and building as attributes), and children (with c_name and age as attributes). Every professor works in only one department; every department is managed by only one professor; the children of the same professor can be distinguished by their c_name (assuming only one parent of a child works for the university). We do not maintain the information of a child once his/her parent leaves the university. Draw an ER Diagram for the university database application described above