Next, write a class named shiftsupervisor class that is also a subclass of the employee class. in a particular factory, a shift supervisor is a salaried employee who supervises a shift. in addition to a salary, the shift supervisor earns a yearly bonus when his or her shift meets production goals. the shiftsupervisor class should keep a data attribute for the annual salary, and a data attribute for the annual production bonus that a shift supervisor has earned.

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)?

Write pseudocode to represent the logic of a program that allows the user to enter a value. the program multiplies the value by 10 and outputs the result.

What would be the address of the cell, which is at the intersection of the second row and the third column in a worksheet?