a) Outline how Algorithm Performance Analysis can be used to compare the quality of algorithms. Make sure to include a description of the order notation and a discussion of common orders. b) Explain in plain English the the Insertion Sort algorithm. c) Provide a pseudo-code representation of the Insertion Sort algorithm. d) Provide an implementation of your Insertion Sort algorithm in the C programming language. e) Compare the effeciency of Insertion Sort and Mergesort for: a random array . a sorted array with single appended element .