2. Diaw an E-R diagram for a restaurant appleaficn that satisfies the follosing constraints. Use. only binary relationships and use no specialieation or aggregation. Then translate the E-R. diagram into fnlational schemat. at. Each branch has a unique branch rame, a location, a seating capocity, and a set of contact phone numbers. b. Each nmployes has a unique ernploype lD. a name conalsting of the firat name. the last name, and the migdle initial, a title, a start date, a number of years of employment, and at contact phone number. e. Each customer has a unique bustamer ID, a namp. and a contact phone number. d. Each transaction has a tramsaction ID, a transaction tirme, an ambunt, and a seat ID. The transaction IDs are unigue for a given branch. e. Each dish has a unique dish 1D, a narre, and a price. f. Each branch has exactly one manager. 9. Each employee works for at most one manager and manages zero or more amployecs. h. Each customer has conducted at least one transucticn; each transaction is: associated with exactly one customer. 1. Each transaction contains zero or mare dishes, a dish can be in any number of trantactions. 1. Each transaction is senved by exactly one employee; each employee can serve zero or more trangactions. k. Each transaction is servad at exactly one branch oach branch has zero or more Wyeke of transactions