Aconsignment shop accepts a product for sale and sets an initial price. each month that the item doesn’t sell, the price is reduced by 20 percent. when the item sells, the item’s owner receives 60 percent of the sale price, and the shop gets 40 percent. draw a flowchart and write pseudocode to represent the logic of a program that allows the user to enter an original product price. the output is the sale price, the owner’s cut, and the shop’s cut each month for the first three months the item is on sale.

Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?