<prompt> Ngola tšebetso ho JavaScript e nkang palo ea lipalo e le ho kenya me e fumana nomoro ea bobeli e phahameng ka ho fetisisa lethathamong.11, 2, 31, 7, 15  <response>: Instruction in English: Write a function in JavaScript that takes an array of numbers as input and finds the second highest number in the array. . Response in English: Heres the solution code in JavaScript:javascriptfunction findSecondHighestarr remove duplicates from array let uniqueArray ...new Setarr; sort the array in descending order uniqueArray.sortfunctiona, b return b - a; ; return second element return uniqueArray1;console.logfindSecondHighest11, 2, 31, 7, 15; . Response in Sesotho: Mona ke khoutu ea tharollo ho JavaScript: mosebetsi oa javascript findSecondHighestarr tlosa tse kopitsoang ho sehlopha let uniqueArray ...new Setarr; hlopha sehlopha ka tatellano e theohang e ikhethangArray.sortmosebetsia, b khutlisa b - a; ; khutlisa element ea bobeli e ikhethangArray1; console.logfindSecondHighest11, 2, 31, 7, 15; 