Question $4$

Consider a timestamp format $"$YYYY$-$MM$-$DD HH:MM:SS$",$ representing year, month, day, hour, minute, and second. Assume all timestamps are from the $21$st century, i$.$e$.,$ YYYY ranges from $2000$ to $2099.$

$($a$)$ Propose a linear$-$time sorting algorithm to sort in non$-$decereasing order an array of strings representing timestamps in the mentioned format. Provide justifications for your choices based on the characteristics of the data and the algorithm's properties.

$($b$)$ Show your algorithm runs in linear time and provide the space complexity.