Exercise Problems #2, #3, & #4 will use relations similar to those in our semester project. Here are each of the relations for this homework: Stores( store id: integer, name: String, address: string) Items( item_name: String, weight: real, color: String ) Inventory( store id: integer, item_name: String, price: real) 2. [8 pts] Provide the SQL that will execute these queries. Find the names of stores that have every item in their inventory. Find all pairs of store ids such that the store with the first id charges more for an item than the second store (second id) charges for the same item. Find the ids and names of all stores which have at least one green and at least one red item in inventory. For every store whose inventory contains at least one green item and at least red item, print the name and price of the most expensive item in the store. a. b. c. d. 3. [8 pts) Convert the SQL queries in the Problem #2 into relational algebra. [3 pts] State what this relational algebra expression computes. (rstore-id((ocolor-blue,Items) ba (price