I am having the hardest time getting this algorithm written: Write an algorithm that returns the index of the first occurrence of the largest element in the sequence s1,..., sn. If the sequence is 6.2, 8.9, 4.2, 8.9, the algorithm returns the value 2. Input: s, n Output: ?? I'm stumped on this at the moment - Any help would be greatly appreciated.