Problem $1.$

$($Greedy Algorithms.$)$ A group of friends is organizing a bike racing

competition. There are $n$ friends and $m$ bikes, but bikes ate not equal, some of them

perform better and some of them perform worse. You may think that each bike has

a performance factor $p_i,1im$ in the range $(1,100)$ where $1$ is the worst and $100$

is the best. Each frieng has a greed factor $g_i,1in$ which is the minimum bike

performace this firend will be content with. Your goal is to maximize the number of

content friends, i$.$e$.,$ friends i assigned a bike $j$ with $g_i{p}_j.$ Give a correct greedy

algorithm for this problem $($