Algorithm design Algorithm design You are given an array A with N rows and N columns Each row of a consists of a series of elements equal to the letter "o", then the rest of its elements are the letter " For example, assuming N-6, one possible instance of array A could be a bbbbb aaa da a aab a abb YOUR TASK Your task is design an algorithm that can determine which row has the largest number of . Your algorithm complexity should be theta(N). . You must write your algorithm in pseudo code and prove that is complexity is THETANS An algorithm with a complexity of theta () will NOT BE ACCEPTED as .VALID Animes IMPORTANT REMARK: The above array A of dimension 66 is just an EXAMPLE, DO NOT DESIGN YOU ALGORITHM SPECIFICALLY FOR THIS ARRAY Algorithe correctes Algorithen complexity of Your algorithm must work for ANY value of N