Consider the subjoined algorithm. ALGORITHM Enigma(A[0..n-l, 0..n-l))) ce j = 0 to n-2 do ce k = j+1 to n-1 do if A[j, k] notequalto A[k, j] reappear unfaithful reappear penny a. What does this algorithm calculate? b. What is its basic action? c. How frequent opportunitys is the basic action performed? d. What is cudgel-predicament opportunity perplexity of this algorithm? e. Suggest an correction or a rectify algorithm fully and denote its cudgel predicament opportunity perplexity. If you cannot do it, sound to ascertain that in reality it cannot be produced.