Answer the following Question :
Problem 1 Using Euclidean Algorithm, Find gcd(1750; 201):
Problem 2 (a)List all the steps used by Maximum Finding Algorithm to Önd the maximum of the list 10; 12; 9; 15; 2; 14 (b) List all the steps used to search for 6 in the sequence 2; 4; 5; 7; 6; 8; 9; 11 using the linear search algorithm.
Problem 3 Build the Hu§man coding tree for the string "taaaakkkkeeeehoome". What is the total number of bits needed to encode the string?
Problem 4 List all the steps used to search for 6 in the sequence 1; 3; 4; 5; 7; 6; 8; 9; 10 using the binary search algorithm.