You are given two sets of numbers: a = {a1,a2,··· ,an}, b = {b1,b2,··· ,bn}. for every permutation π on {1, 2, · · · , n}, define its score n score(π) = − bπ( . i=1 design an algorithm that outputs the permutation π∗ with the maximum score. proof the correctness of your algorithm.

Ask your question to the AI advisor

Ai-bot is an expert in any field and is the perfect companion for reliable and useful answers and advice on a variety of topics, including science, history, technology, art, sports, health, culture and more.