computational complexity programming problems devise an experiment to discover the complexity of comparing strings in python does the size of the string affect the efficiency of the string comparison and if sowhat is the complexity of the comparisonin this experiment you might want to consider best caseworst caseand average case complexity write program that produces an xml file with your results in the format specified in this then use the plotdata py program to visualize those results conduct an experiment to prove that the product of two numbers does not depend on the size of the two numbers being multiplied write program that plots the results of multiplying numbers of various sizes together hintto get good reading you may want to do more than one of these multiplications and time them as group since multiplication happens pretty quickly in computer verify that it truly is ( operation do you see any anomaliesit might be explained by python' support of large integers what is the cutoff point for handling multiplications in constant timewhywrite program that produces an xml file with your results in the format given in this then visualize your results with the plotdata py program provided in this write program to gather experimental data about comparing integers compare integers of different sizes and plot the amount of time it takes to do those comparisons plot your results by writing an xml file in the ploy py format is the comparison operation always ( )if notcan you theorize whyhintyou may want to read about python' support for large integers write short function that searches for particular value in list and returns the position of that value in the list ( its indexthen write program that times how long it takes to search for an item in lists of different sizes the size of the list is your gather results from this experiment and write them to an xml file in the plotdata py format what is the complexity of this algorithmanswer this question in comment in your program and verify that the experimental results match your prediction thencompare this with the index method on list which is more efficient in terms of computational complexityhintyou need to be careful to consider the average case for this problemnot just trivial case write short function that given listadds together all the values in the list and returns the sum write your program so it does this operation with varying sizes of lists record the time it takes to find the sum for various list sizes record this information in an xml file in the plotdata py format what complexity is this algorithmanswer this in comment at the top of your program and verify it with your experimental data compare this data with the built-in sum function in python that does the same thing which is more efficient in terms of computational complexityhintyou need to be careful to consider the average case for this problemnot just trivial case assume that you have datatype called the clearable type this data type has fixed size list inside it when it is created so clearable( would create clearable list of size objects of the clearable type should support an append operation and lookup operation the lookup operation is called __getitem__(itemif cl is this copy belongs to 'acha