Q1: (20 Points) Assume that a chain of computer stores that sells computers, components, and parts uses the following global schema for a relational database that keeps information about items at each store. Item (itemNo, item ane, supplier, unit festa) Store (stereName, state, manager, telephone) Stock itemder storeName, atxinland, Leerderbrint) The company has stores in five different states (namely, Minnesota, Illinois, California, Indiana, and Maryland). Assume that the company stock about 15000 different items. Each item comes from only one supplier but the same supplier can supply several items. The database keeps track of what items are in which store and the reorder point which is the number of items that is the minimum each store wishes to keep in stock. When the quantity on hand falls to the reorder point, state's manager contacts supplier to place a new order. Note that, each store serves customers in its own geographical area. Assume all this information is currently stored in a central database. The company hired you to design a distributed database for their system hoping to make operations more efficient. a) Assume there are 6 sites for the distributed database such that there is one site in each state and one central site. Choose a data distribution schema on the 6 sites and justify your choice (you may consider replication). Note that your schema should support efficient operation of the daily store transactions (eg. Check the available quantity on hand for item named 'Hammer' in a store names 'XYZ'). b) Write your fragmentation schema using relational algebra. For each fragment, identify the location where it will be stored