For some computational Problem P$,$ say you designed two algorithums A and B$.$ The runtime of A is T$($N$)<=5$nlogn and that of B is T$($n$)<=6$nlogn$+6$n$+10^2.$ Now what can be said about these algorithums? Options: A$.$ B is considered to be better when analyzed using big o notation. B$.$ A is is considered to be better when analyzed using big o notation. C$.$ Both are consiered equally efficent