The algorithm of Figure 10.5 always produces a string of four characters independent of the sign and magnitude of the integer being converted. Devise an algorithm that eliminates unnecessary characters in common representations, that is, an algorithm that does not store leading 0s nor a leading + sign.

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.

IN VISUAL BASIC, solve Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.

coding