Java/Data Structures: Adding entries to the end of a list does not change the positions of entries already in the list. (True or False)

T/F: All recursive algorithms are efficient due to its recursive property.

Magic Number of coding-:A number is said to be a magic number,if summing the digits of the number and then recursively repeating this process for the given sumuntill the number becomes a single digit number equal to 1. Example:    Number = 50113 => 5+0+1+1+3=10 => 1+0=1 [This is a Magic Number]    Number = 1234 => 1+2+3+4=10 => 1+0=1 [This is a Magic Number]    Number = 199 => 1+9+9=19 => 1+9=10 => 1+0=1 [This is a Magic Number]    Number = 111 => 1+1+1=3 [This is NOT a Magic Number].

Task- Median elements (C Language) Example #4 expected output is 5, but from the program below its coming out to 4. Please help make it come out to 5 as expected Given an array of integer elements, the median is the value that separates the higher half from the lower half of the values. In other words, the median is the central element of a sorted array. Since multiple elements of an input array can be equal to the median, in this task you are asked to compute the number of elements equal to the median in an input array of size N, with N being an odd number. Requirements Name your program project4_median.c. Follow the format of the examples below. The program will read the value of N, then read in the values that compose the array. These values are not necessarily sorted. The program should include the following function. Do not modify the function prototype. int compute_median(int *a, int n); a represents the input array, n is the length of the array. The function returns the…