Implement most frequent key without using max()

You are given a Parent class that precomputes information from an input list. It stores: self.items: the original list. self.string_set: a set containing each element converted with str. self.string_counts: a dictionary mapping each stringified element to how many times it occurs. A Child class inherits from Parent. Complete the Child.most_frequent_key method. Requirements: Find the highest frequency among the stringified keys. Return a list[str] containing every key whose…