1A. Let A be the adjacency matrix of an undirected graph. Defining each of the following explain what property of the matrix indicates that i) the graph is complete. i) the graph has a loop. ili) the graph has an isolated vertex 1B. The brute-force algorithm for computing the value of a polynomiat at a given point Xo is given below Algorithm Brute ForcePolynomial Evaluation(P[o.n).x) Input: Array P/o.n] of the coefficients of a polynomial of degree n, // stored from the lowest to the highest and a number Output: The value of the polynomial at the point x p-0.0 for i- n downto 0 do power 4-1 for j ? 1 to ido power ? power *x p ? p + P [i] * power returnp i) Analyse the efficiency of this algorithm considering multiplication as the basic operation ii) Design an algorithm with an efficiency better than this and prove it