Given an array A of n integers, a leader element of the array A is the element that appears more than half of the time in A. Using one stack, implement in Java an O(n) running time complexity method static int leader(int[] A) to find a leader element and return the index (any) of the leader in A. The program must returns -1 if no leader element exists. Examples:int[] a = {23, 23, 67, 23, 67, 23, 45}; > leader(a) = 6int[] a = {23, 24, 67, 23, 67, 23, 45}; > leader(a) = -1

What kind of motivation is katrina showing? use the drop-down menu to complete the statement. katrina is using motivation because she is personally interested in learning more.

Which one of the following functions is not available on the autosum tool? sum average if max

Function name: poly parameters: int returns: int description: a polynomial of degree n with coefficients a0,a1,a2,a3, . . ,an is the function p(x) = a0+a1x+a2x2+a3 ∗ x3+ . . +an ∗ xn this function can be evaluated at different values of x. for example, if: p(x) = 1+2x+ x2, then p(2) = 1+2 ∗ 2+22 = 9. if p(x) = 1+x2+x4, then p(2) = 21 and p(3) = 91. write a function poly() that takes as input a list of coefficients a0, a1, a2, a3, . . , an of a polynomial p(x) and a value x. the function will return poly(x), which is the value of the polynomial when evaluated at x.