Please answer 6 -8

6) Rank the graphs above by rate of growth, fastest first. Code Analysis )Implement and test each of the follawing series for several different values of n and A. Present your autput in a nice table af values. Use iterative solutions, do nat use the equivalent (condensed) algebraic formula. L Arithmetic Series Test for values of n fram 1 to 10-5e : + + + + N N 1 1 2 3 Iterative cade solution: t sum 0 sumsum+ Geometric Series Test for values of n from 1 to 5 and A from 1 to 5 (25 rows total). Iterative cade solution: t term, sum0 sum+term n sum Il. A Mare Efficient Geometric Series Redo the previous solution using only a single aop instead of the nested loop. Your salution should have a BicOIn) time complexity V. Another Series implement the following series and test for n Produce a nice table of values 1 to 5 and A 1 to 5 25 rows total. 8) For the previous series implementations, determine the BigQ of each series by analysis of the source code. A code analysis using our Big O "rules of thumb" is suffirient: you do nat need to perform an exact mathematical analysis List the Big O answer and explain why it is so in English