hello sir , i just want the final answer i dont full answer, i promise to comment and like your solution, please answer all of the question because theres no time post the qusteions anathoer time and i dont want the full answer,only the last answer but please solve all of question ,thank u

Question 7 In assignment job problem if the cost matrix looks like Not yet answered Marked out of 1.00 Flag question 9278 6537 5826 3194 then the cost of the combination (2, 3, 4, 1) is a. 14 O b. 18 O c. 10 O d. 20 Question 8 Not yet answered Marked out of 8.00 In the elections, the winner has a majority when he wins more than half of entries votes. which means more than half of array A[1....n) are the same, the task is: 1. Design a BF efficient algorithm to tell whether the array has a majority element, and, if so, to find that element. Then derive time complexity. 2. Design a D & C algorithm to tell whether the array has a majority element, and, if so, to find that element. Then derive the time complexity. Flag question Question 11 Not yet answered Let array A= {20, 3, 10, 9, 17, 12, 8, 13, 2, 5, 11} after using the Lomuto partition to find the median the split point after second iteration is O a. 6 Marked out of 2.00 O b.7 Flag question O c. 2 O d. 4 Question 13 We want to send a message from the start node s to the all nodes in the network, by taking the shortest pat, this problem can be simulated as Not yet answered O a. TSP Marked out of 1.00 Flag question O b. Assignment job problem O c. Knapsack problem O d. Binary search problem Question 15 The sort that divides the problem size according to the index of the items is Not yet answered a. count Marked out of 1.00 O b. quick Flag question O c. merge O d. radix