Given the schema: Customer(custId, custName, custAdd, creditLimit)
Order(orderNo, custId, date, orderTotal, deliverToName, deliverToAddress)
Assume Customer has 1000 records, 200 bytes each. It is in order by custId, and has an index on CustName with two levels. There are 950 values for custName. Order has 5000 records, each 300 bytes. It is in order by orderNo and has an index on custId with three levels. Assume page size is 4096 bytes for both files.
Give an efficient strategy for the following query and estimate its cost, using an appropriate formula:
SELECT Customer WHERE custName ='Bob Davis'

Write a function called checkfactor that takes two arrays of positive numbers, firstnumberrow and secondnumberrow. checkfactor checks if the first entry in firstnumberrow is divisible by the first entry in secondnumberrow, and performs the same operation on the next array elements until all entries have been checked. all the numbers are positive and the number of entries in the arrays are the same. the function should return the identified divisible numbers in two row arrays named firstdivisible and seconddivisible.restrictions: branches or loops should not be used. the code must use the internal mod and logical functions.hint: the mod function should be used to determine if two numbers are divisible. ex: for num1 and num2 if mod(num1,num2) is 0, then the two numbers are divisible.this is matlab