Solve Question 2:Given two arrays a and b, where both arrays consisting of n positive integers. It is allowedto swap any element from array a with any element from b. Your task is to findthe maximum possible sum you can obtain in the array a if you can do no more than (i.e.at most) k moves (swaps).InputThe first line of the test case contains two integers n and k (1sns30:0sksn) –where n is the number of elements in a and b, while k is the maximum number ofmoves you can do.The second line of the test case contains n integers a1.az. a.The third line of the test case contains n integers b.b.bnOutputPrint the answer- the maximum possible sum you can obtain in the array a if you cando no more than (i.e. at most) k swaps.Examples:Ex 1:Ex 2:Ex 3:Input55556651254327534022431234510910 10 9392423Output:11In the first test case of the example, you don't need to swap anythingIn the second test case of the example, you can swap ar=1 withb;=10, as-3 with by=10 and a,=2 with b=10,so a=[10,10,10.4,5] and b-[1,9.3.2.9].• In the third test case of the example, you cannot swap anything.a) Design a brute-force algorithm to solve this problem using a (Pseudocode) and find itscomplexity. (5 +3 marks)b) Can you design a more efficient solution? If yes, demonstrate it using Pseudocodeand analyze its complexity. (5 + 3 marks)c) Implement your efficient solution using Python (4 marks) create a use case todemonstrate your solution (4 marks)d) Provide a brief report (250 words) that explain the difference between the two solution(6 marks)Page 3 of 5

Brute force algorithm is - 1. Sort both arrays in ascending order a.sort() b.sort() 2 Swap minimum…

Question 2: Given two arrays a and b, where both arrays consisting of n positive integers. It is allowed to swap any element from array a with any element from b. Your task is to find the maximum possible sum you can obtain in the array a if you can do no more than (i.e. at most) k moves (swaps). Input • The first line of the test case contains two integers n and k (1sns30,0sksn) – where n is the number of elements in a and b, while k is the maximum number of moves you can do. The second line of the test case contains n integers a1.az. a. • The third line of the test case contains n integers br.b2.bn Output Print the answer- the maximum possible sum you can obtain in the array a if you can do no more than (i.e. at most)k swaps. Examples: Ex 1: 55 55665 12543 Ex 2: 53 12345 10910 10 9 39 Ex 3: 40 2243 2423 11 Input Output: 27 • In the first test case of the example, you don't need to swap anything. • In the second test case of the example, you can swap ar=1 with b;=10, as=3 with by=10 and a;=2 with b=10, so a=[10,10,10.4,5] and b=[1,9.3.2.9]. In the third test case of the example, you cannot swap anything. a) Design a brute-force algorithm to solve this problem using a (Pseudocode) and find its complexity. (5 +3 marks) b) Can you design a more efficient solution? If yes, demonstrate it using Pseudocode and analyze its complexity. (5+3 marks) c) Implement your efficient solution using Python (4 marks) create a use case to demonstrate your solution (4 marks) d) Provide a brief report (250 words) that explain the difference between the two solution (6 marks)

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE