Solving the following problems 1.la) Write an algorithm for finding the minimum in n integers a a1,a2..... a n al, a2,., an , where a 1,a 2.,.., an a1, a2, an are given. The name lne can be Procedure Minlint a1,a2, n a1, a2,, an (b) How many comparisans are there in your algorithm? 2.lal write an algorithm for calculating the summation of n integers a . a 2-, a n a1, a2, an , where a1,a2.,.., an a1, a2, an are given. The name line can be Procedure Summatian (int a 1,a2.,...an al, a2, ., an (b) How many additions are there in your algorithm? 3-(a) Write an algorithm for calculating the multiplication of n integers a1,a2,an al, a2, ., an , where a 1,a2, .., arn al, a2.,.., an are given. The name line can be Procedure Multiplication (int a 1,a2., a n a1, a2,.., ar (b) How many multiplications are there in you algorithm