A$.$ In the following Table, for each of the given algorithms design paradigms $($rows$)$ and computational problems $($columns$),$ fill in the empty spaces with appropriate words $($in case of no algorithm solving the given problem write $"$NA$",$ and in case of unknown Algo. Name, provide a brief characterization of the algo.$).$SortingPolynomial EvaluationPowering a numberGreatest Common DivisorBrue$-$force AlgorithmAlgo. NameTanc ComplexityDecrease and Conquer AlgoruhmAlgo. Name Time ComplexityType of decreaseDivide and Conquer AlgorithmAlgo Name Tane ComplexityTransform and AlgorithmAlgo. Name Time ComplexityType of transform