Suppose a group of 9 sales price records has been stored as follows: 9, 25, 28, 30, 48, 72, 78, 195, 213 Partition them into three bins then smoothing them by the following methods: Partition into equal-width then smoothing by bin means. Partition into equal-depth then smoothing by bin boundaries.

Given code that reads user IDs (until -1), complete the quicksort() and partition() functions to sort the IDs in ascending order using the Quicksort algorithm. Increment the global variable num_calls in quicksort() to keep track of how many times quicksort() is called. The given code outputs num_calls followed by the sorted IDs. Ex: If the input is: kaylasimms julia myron1994 kaylajones -1 the output is: 7julia kaylajoneskaylasimmsmyron1994 given uncomplete code: python 3 # Global variablenum_calls = 0 # TODO: Write the partitioning algorithm - pick the middle element as the # pivot, compare the values using two index variables l and h (low and high), # initialized to the left and right sides of the current elements being sorted,# and determine if a swap is necessary def partition(user_ids, i, k):# TODO: Write the quicksort algorithm that recursively sorts the low and # high partitions. Add 1 to num_calls each time quisksort() is called def quicksort(user_ids, i, k): if __name__ ==…

def sort_by_digit_count(items): Sorting can be done according to arbitrarily chosen comparison criteria, as long as they satisfy the mathematical requirements of a total ordering relation. To play around with this concept, let us define a wacky ordering comparison of positive integers so that for any two integers, the one thatcontains the digit 9 more times than the other is considered to be larger, regardless of the magnitude and other digits of these numbers. For example, 99 > 12345678987654321 > 101000 in this ordering. If both integers contain the digit 9 the same number of times, the comparisonproceeds to the next lower digit 8, and so on, until the first distinguishing digit has been discovered. If both integers contain every digit from 9 to 0 pairwise the same number of times, the ordinary integer order comparison will determine their mutual ordering. items expected results [9876, 19, 4321, 99, 73, 241, 111111, 563, 33] [111111, 33, 241, 4321, 563, 73,19, 9876, 99]…

TODO: Lienar Regression with least Mean Squares (LMS) Optimize the model through gradient descent. *Please complete the TODOs. * !pip install wget import osimport randomimport tracebackfrom pdb import set_traceimport sysimport numpy as npfrom abc import ABC, abstractmethodimport traceback from util.timer import Timerfrom util.data import split_data, feature_label_split, Standardizationfrom util.metrics import msefrom datasets.HousingDataset import HousingDataset class BaseModel(ABC):    """ Super class for ITCS Machine Learning Class"""     @abstractmethod    def fit(self, X, y):        pass     @abstractmethod    def predict(self, X):        pass class LinearModel(BaseModel):    """        Abstract class for a linear model         Attributes        ==========        w       ndarray                weight vector/matrix    """     def __init__(self):        """            weight vector w is initialized as None        """        self.w = None     # check if the matrix is 2-dimensional. if…