- give short fragment of python code that uses the progression classes from section to find the th value of fibonacci progression that starts with and as its first two values - when using the arithmeticprogression class of section with an increment of and start of how many calls to next can we make before we reach an integer of or largerr- what are some potential efficiency disadvantages of having very deep inheritance treesthat isa large set of classesabcand so onsuch that extends ac extends bd extends cetc - what are some potential efficiency disadvantages of having very shallow inheritance treesthat isa large set of classesabcand so onsuch that all of these classes extend single classzr- the collections sequence abstract base class does not provide support for comparing two sequences to each other modify our sequence class from code fragment to include definition for the eq methodso that expression seq =seq will return true precisely when the two sequences are element by element equivalent - in similar spirit to the previous problemaugment the sequence class with method lt to support lexicographic comparison seq seq creativity - suppose you are on the design team for new -book reader what are the primary classes and methods that the python software for your reader will needyou should include an inheritance diagram for this codebut you do not need to write any actual code your software architecture should at least include ways for customers to buy new booksview their list of purchased booksand read their purchased books - exercise - uses the mul method to support multiplying vector by numberwhile exercise - uses the mul method to support computing dot product of two vectors give single implementation of vector mul that uses run-time type checking to support both syntaxes and kwhere and designate vector instances and represents number - the sequenceiterator class of section provides what is known as forward iterator implement class named reversedsequenceiterator that serves as reverse iterator for any python sequence type the first call to next should return the last element of the sequencethe second call to next should return the second-to-last elementand so forth