Write a function named find_median that takes as a parameter a list of numbers. The function should return the median of those numbers, which will require it to sort the list. If you're not familiar with calculating the median, please look that up. Remember that the calculation is different for odd and even groups of values. For example, it could be used like this: some_nums

You need a quick answer from a coworker. the most effective way to reach your coworker is through a. cloud server b. instant message c. teleconference d. telepresence

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

How to do this programming flowchart?