$($A$)$ Write sece for Menge $($A$[],a,b,c,b$

whices merges rangs $[a-b]cdots-y_1$ range $c-d$ in array $A.$

OR

$($B$)$ Write sote for $k-$hop seanch for $k=14$ on or arroy of size $n.$ Dont forget the ase if $14$ doesn't parfecty livie $n$ What's the worst case of number of componims of yorr cote for $n=300.$