<prompt> Theha tšebetso ho Java e nkang palo e felletseng le ho hlahloba hore na e na le tse kopitsoang.nan  <response>: Instruction in English: Create a function in Java that takes array of integers and checks if it contains duplicates. . Response in English: Heres an example of a Java function that takes an array of integers as input and returns a boolean value indicating whether it contains any duplicates or not:public boolean containsDuplicatesint nums Set set new HashSet; forint n : nums ifset.containsn return true; set.addn; return false;In this function, we use a Set data structure to keep track of the numbers encountered in the array. We iterate through the given array of integers one by one, and for each integer, we first check if it is already present in the Set. If it is, then it means the array contains duplicates and we return true. Otherwise, we add the integer to the Set and move to the next integer. If no duplicates are found after iteration is complete, we return false.This solution has a time complexity of On since we are processing each integer in the array exactly once. . Response in Sesotho: Mohlala ke ona oa tšebetso ea Java e nkang palo e felletseng e le ho kenya le ho khutlisa boleng ba boolean bo bontšang hore na e na le tse kopitsoang kapa che: public boolean containsDuplicatesint nums Set set new HashSet ; forint n : nums ifset.containsn kgutlela nneteng; set.eketsan; kgutlisetsa leshano; Tsebetsong ena, re sebelisa Set data sebopeho ho boloka tlaleho ea linomoro tse kopaneng le sehlopha. Re pheta-pheta ka palo e fanoeng ea palo ka bonngoe, me bakeng sa palo e ngoe le e ngoe, re qala ka ho hlahloba hore na e se e le teng ho Sete. Haeba ho joalo, ho bolela hore sehlopha se na le likopi, me re khutlisa nete. Ho seng joalo, re kenya nomoro ho Setha ebe re fetela ho nomoro e latelang. Haeba ho se na tse fumanwang ka mora hore phetisetso e phethe, re khutlisetsa false. Tharollo ena e na le ho rarahana ha nako ea On kaha re ntse re sebetsana le palo e ngoe le e ngoe e hlophisitsoeng hantle hang. 