Below is a table that shows the timing of three different algorithms using an array of integers as input. Explain which of the algorithms is most likely the selection sort and which is the merge sort, explain in details your answer.

$\backslash$table$[[,\backslash$table$[[$time to process$],[2000$ integers$]],\backslash$table$[[$time to process$],[4000$ integers$]],\backslash$table$[[$time to process$],[8000$ integers$]]],[$Algorithm $1,0\mathrm{.}1431sec,0\mathrm{.}5722sec,2\mathrm{.}2989sec$