Given an integer n (with 1 s n s 40), we want to produce a program that nswereddisplays the equivalent of n, in the roman numerals. Assume that the user will out of 2.00 question always enter a valid value for n. To get full mark, you solution must use at most 2 loops (while or for loops) and at most two selections (switch case or if. else if .. else if) 2 3 4 6 8 9 10 VII VIII IX X 11 12 13 14 15 16 17 1819 20 Xi XII X XIV XV XVI XVII XVIII XIX XX 21 22 2324 25 26 2728 29 30 XXI XXII XXIII XXIV XXV XXVI XXVII XXvillI 31 3233 34 35 36 37 38 39 40 xxIx xx