String Rotation Analysis

Problem Statement

String Rotation Analysis Problem Description You are given an array A consisting of strings made up of the letters 'a' and 'b' only. Each string goes through a number of operations, where: At time 1, you circularly rotate each string by 1 letter. At time 2, you circularly rotate the new rotated strings by 2 letters. At time 3, you circularly rotate the new rotated strings by 3 letters. At time t, you circularly rotate the new rotated strings by t % length(string) letters. Eg: String is "abaab" At time 1, string is "abaab", as 1 letter is circularly rotated to the back At time 2, string is "aabaa", as 2 letters of the string "baab" is circularly rotated to the back At time 3, string is "aaab", as 3 letters of the string "aaab" is circularly rotated to the back At time 4, string is again "aaab", as 4 letters of the string "aaab" is circularly rotated to the back At time 5, string is "aaaba", as 1 letters of the string "aaab" is circularly rotated to the back After some units of time, a s