The time complexity of multiplying two large $N$ digit numbers using the Divide$-$

and$-$Conquer algorithm is around:

$O(logN)$

$O(N^{2\mathrm{.}8})$

$O(N)$

$O(N^{1\mathrm{.}5})$