Design an algorithm in pseudocode to print the total bits using Huffman code encoding 2 .write down the Algorithm analysis. 3. The complexity of the algorithm must be in O(n)

i. Using the graph below, implement the Iterative Deepening Search algorithm considering the final state is six(6) and the initial state is zero(0) using the python programming language.   N.b Kindly add comments to your code ii.. Descriibe in summary how the algorithm was implemented.

There are various sorting algorithms available to sort data of different sizes. Three of these algorithms are Bubble sort, Shell sort, and Quicksort. In Python, write a program to generate random integer numbers of multiple sizes; 10000, 30000, 40000, 50000, and 70000, and find out which of these sorting algorithms perform the fastest sorting technique. Provide data to prove and support your findings or results by plotting a graph showing the time each takes to sort data of various sizes. It should be written in a single program. Write the code in python and also show the graphical result. Also do the proper identation of the code.

Assume that each of the following expressions indicates the number of operations performed by an algorithm for a problem size of n. Point out the dominant term of each algorithm and use big-O notation to classify it.   2n – 4n2 + 5n 3n2 + 6 n3 + n2 – n