characters in the strings adding it all up gives us ( steps that is (nwe have found linear order of magnitude algorithm for solving this problem before leaving this examplewe need to say something about space requirements although the last solution was able to run in linear timeit could only do so by using additional storage to keep the two lists of character counts in other wordsthis algorithm sacrificed space in order to gain time this is common occurrence on many occasions you will need to make decisions between time and space trade-offs in this casethe amount of extra space is not significant howeverif the underlying alphabet had millions of charactersthere would be more concern as computer scientistwhen given choice of algorithmsit will be up to you to determine the best use of computing resources given particular problem self check - given the following code fragmentwhat is its big- running timetest for in range( )for in range( )test test ( ( (log ( - given the following code fragment what is its big- running timetest for in range( )test test for in range( )test test ( ( (log ( - given the following code fragment what is its big- running timei while / what is algorithm analysis