Write a function with your netid as the name. It should take one input, array$1.$ It should return one output, out$1.$

array$1$ is an array with $3$ elements.

Define the following values in your function:

m $-$ The number that is the largest value in array$1.$

n $-$ The sum of all of the numbers in array$1.$

k $-$ The number in the $1$st index of array$1.$

out$1$ should be m$/$k $+$ n$.$

You may not use the commands min, max, or sum in this function. Assume that all elements of array$1$ are different.

B$.$ How many test cases do you need for this function? Why?