Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python or java. The time complexity has to be as less as possible (nlogn or n at best, no n^2).Hint: Use inversion index nlogn approachOutput FormatThe output consists of one line containing an integer indicating the number of quantum blasts per second that Butz must fire at Swapper to prevent him from sorting the books in the worst-case scenario (best case for Swapper). If this number is not a whole number, just to prevent Swapper from ever succeeding, round up to the nearest whole number. If it is impossible for Butz to stop Swapper from restoring order to the shelf, print "Butz loses!" without quotes.Sample Input 04 34 1 3 2Sample Output 02Sample Input 15 32 4 0 3 1Sample Output 11Sample Input 26 55 0 1 2 4 3Sample Output 21The actual code in Pythondef solve(books,n,s): # TODO: Compute and print the answer here passdef main(): n, s = list(map(int,input().strip().split(" "))) books = list(map(int,input().strip().split(" "))) solve(books,n,s)if __name__ == "__main__": main()The actual code in javaimport java.io.BufferedReader;import java.io.InputStreamReader;public class c { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb = new StringBuilder(); String[] parts = br.readLine().trim().split(" "); int n = Integer.parseInt(parts[0]); int s = Integer.parseInt(parts[1]); int[] books = new int[n]; parts = br.readLine().trim().split(" "); for(int i = 0; i < n; i++) { books[i] = Integer.parseInt(parts[i]); } solve(books,n,s); } public static void solve(int[] books, int n, int s){ // TODO: Compute and print answer here }} Butz isn't taking any chances. Assuming the universe bestows the ultimate curse, which isthat Swapper swaps randomly and through astronomical odds sorts the books either inascending or descending order (either is equally displeasing to Butz) as fast as possible,how many quantum blasts per second must Butz fire at Swapper to prevent the atrocity ofa sorted set of books from ever manifesting on any level of reality?Input FormatInput consists of one test case, containing N and S indicating the number of books onthe shelf and the number of quantum blasts Swapper can take before being banished intoTodash space.The second line contains N distinct space-separated integers B₁, representing the IDcodes of the books. If Swapper sorts the books in either ascending or descending ID codesB₁, Butz will be royally cross with him and will probably destroy several realities to relax.NOTE: If you were an innocent bystander, you may, of course, play this as a classic trolleyproblem of a.) let Swapper be banished to Todash, or b.) let countless realities perish, butin this example, you are Butz, so no need to worry about the ramifications. :DConstraints1≤N, S≤ 2.1050 ≤ B; ≤ 107Output FormatOutput consists of one line containing an integer indicating the number of quantum blastsper second that Butz must fire at Swapper to prevent him from sorting the books in theworst case scenario (best case for Swapper). If this number is not a whole number, just toprevent Swapper from ever succeeding, round up to the nearest whole number. If it isimpossible for Butz to stop Swapper from restoring order to the shelf, print "Butz loses!"without quotes. Swapper is a notorious, well, swapper. Whenever he sees objects in a line, he like to swapthem. He can, however, only swap two objects that are adjacent. He does this randomly,but every now and then, through astronomical odds, after performing enough swaps, theobjects find themselves in a particularly desirable order.Take for example playing cards. If Swapper sees four playing cards with values {4, 1, 3, 2}, he can do the following:1. Swap 1 and 3, resulting in {4, 3, 1, 2};2. Swap 1 and 2, resulting in {4, 3, 2, 1}Through astronomical odds, Swapper has accidentally arranged the playing cards indescending order.Butz is an agent of chaos, who happens to be a monkey as well, and he hates it whenobjects are organized. He has a particularly intense disdain for objects arranged inascending or descending order. He believes sorted lists to be an abomination to thenatural order of the universe, which is chaos. All things gravitate towards a natural state ofentropy.Butz likes going around various universes, simply to preserve the natural order of things,which is a lack thereof, and he goes by many names: Nyarlathotep, Randall Flagg, orRichard Faraday. The list goes on. Unfortunately, this time around, he landed in a smallSpanish village, where Swapper resides.Currently, Swapper has stumbled upon a library with shelves and shelves of books. Mostof them are sorted, but a new assortment of N books has just come in and is notarranged at all. Swapper's compulsion kicks in he would like to begin his crazy trend ofrandomly swapping pairs of books. Butz is none too pleased at this new circumstance andwould like to account for the worst case scenario, which is that, by astronomical odds,Swapper succeeds in sorting the books, either in ascending or descending order.Butz can fire a quantum blast at Swapper to slow him down. Swapper can take Squantum blasts before being blasted into the Todash space, the realm between realities.However, Swapper can swap exactly one pair of books each second.

An inverted index which refers to the one it is an index data structure that stores a mapping from…

Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python or java. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Hint: Use inversion index nlogn approach Output Format The output consists of one line containing an integer indicating the number of quantum blasts per second that Butz must fire at Swapper to prevent him from sorting the books in the worst-case scenario (best case for Swapper). If this number is not a whole number, just to prevent Swapper from ever succeeding, round up to the nearest whole number. If it is impossible for Butz to stop Swapper from restoring order to the shelf, print "Butz loses!" without quotes. Sample Input 0 4 3 4 1 3 2 Sample Output 0 2 Sample Input 1 5 3 2 4 0 3 1 Sample Output 1 1 Sample Input 2 6 5 5 0 1 2 4 3 Sample Output 2 1 The actual code in Python def solve(books,n,s): # TODO: Compute and print the answer here pass def main(): n, s = list(map(int,input().strip().split(" "))) books = list(map(int,input().strip().split(" "))) solve(books,n,s) if __name__ == "__main__": main() The actual code in java import java.io.BufferedReader; import java.io.InputStreamReader; public class c { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb = new StringBuilder(); String[] parts = br.readLine().trim().split(" "); int n = Integer.parseInt(parts[0]); int s = Integer.parseInt(parts[1]); int[] books = new int[n]; parts = br.readLine().trim().split(" "); for(int i = 0; i < n; i++) { books[i] = Integer.parseInt(parts[i]); } solve(books,n,s); } public static void solve(int[] books, int n, int s){ // TODO: Compute and print answer here } }