Given the following two already sorted subarrays, how many comparions are needed to merge with merge sort algorithm?

a $=[2,8,10,14]$

b $=[1,5,11,20]$

$3$

$4$

None of them

$5$

$2$