For each example choose one of the following sorting algorithms and carefully justify your choice: heapsort, radixsort, countingsort. give the expected runtime for your choice as precisely as possible. if you choose radix sort then give a concrete choice for the basis (i. e. the value of "r" in the book) and justify it. sort the length 2^16 array a of 128-bit integers on a device with 100mb of ram. sort the length 2^24 array a of 256-bit integers on a device with 600mb of ram. sort the length 2^16 array a of 16-bit integers on a device with 1gb of ram.

The great length of north america causes the climate to be varied. true false

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

Technician a says that a new replacement part is always good. technician b says that sometimes recent repair work will be the cause of a complaint. who is correct? a. both technicians a and b b. technician a c. technician b d. neither technician a nor b