For each call of the method below, write the output that is printed and the value that is returned: public static int LoopMysteryExam3(int x, int y)
{
int z = x + y;
while (x > 0 && y > 0)
{
x = x - y;
y--;
Console. Write(x + " " + y + " ");
}
Console. WriteLine(y);
return z;
}
LoopMysteryExam3(7, 5); output
LoopMysteryExam3(7, 5); return
LoopMysteryExam3(20, 4); output
LoopMysteryExam3(20, 4); return
LoopMysteryExam3(40, 10); output
LoopMysteryExam3(40, 10); return

The following code performs a familiar operation upon a specified subrange of an array of integers. void orderedinsert (int arr[], int first, int last, int target) // insert target into arr such that arr[first..last] is sorted, // given that arr[first..last-1] is already sorted. { int i = last; while ((i > first) & & (target < arr[i-1])) { arr[i] = arr[i-1]; i = i - 1; } arr[i] = target; } using the style of the standard library generic functions as a guide, rewrite this so that it can work on a subrange of arrays or linear sequence containers of any element type.