Page HIS 307 / C? in-class task public class CH7 class4 nkithoutMin t public statie void main(Stringl args) C87 classt sun ithoatMin classinew / In this main ethod, Eour fundanental algorithas are By combining the fundamental algorithms, CH elass4 sumkichoutMinO given / vrite an algorithn to calculate the sum vithout the inima doubletl nmbers-30,95, 96,20,92,37,-27,-62,72,-8 (1) Finding the ninimum double minValue -class4.getMininus (numbers) : System.out.printin(sinimum value is minValue)i 12) Finding the location of the minimum value int smallestPosstion class4.getMinimumication (nunbers): Systes.aus.printin ("nininun value " + nvalue + _ i, at index sallestPosition) 3) Calculating the sum double total - classs.getSun (numbers)i System.out printin("totalistotal) 4) Ramoving an element int indexS doublet1 updatedValues -class.removeElenent (nuabers, index).cloneO // Your implezantation / write an algorithn to ealeulate the sun without the double1 zando usber66,39,9, 55, 52,33,-57-4.66.- double sum without in Systes.out.pzintin("u without the min+ mininun 65): u vathout min)s / expected anavr34 There is slcernative vay to ealeulate the sum vi thout // U#e exactly two sethod. " caigui ate the lum without double sum without inz i the min the rinNux hp Page