Assume that every regnal name contains a valid Roman numeral as its regnal number. Implement the following function in the code editor that sorts the rulers' names ascending, first by regnal number and then by $($case$-$sensitive$)$ regnal name.

$///$ aparam names The unordered collection of regnal names. A complete regnal name may appear more than once in the $///$ collection.

$///$ apre ap names is not empty. $///$ areturns A new b$$llection containing the same contents as ep name but in ascending sorted order, first by regnal $///$ number and then by regnal name.

std: : vector