Write a class that contains the following two methods: /* Convert from Celsius to Fahrenheit / public static double celsiusToFahrenheit(double celsius) *Convert from Fahrenheit to Celsius */ public static double fahrenheitToCelsius(double fahrenheit) The formulas for the conversion are as follows: Fahrenheit = (9.0 / 5) * Celsius + 32 Celsius = (5.0/9) *(Fahrenheit-32) Write a test program that invokes these methods to display the following tables: Celsius 40.0 39.0 FahrenheitIFahrenheit 104,0 102,2 Celsius 48.89 43.33 120.0 110.0 32.0 89.6 40.0 31.0 7.8 30

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