What is the big$-$O time complexity for the following algortihm? Count the operations, breifly stating each part, what are the counted operations and then summarized to big$-$O:

public int testMethod$($int$[]$ a$)$

$\{$

BubbleSort$($a$)$;

for$($ int i $=0$; i $<10$; i$++)$

BinarySearch$($a$,$ i$)$;

for$($int i $=0$; i $<$ n$-1$; i$++)$

a$[$ i $]+=$ a$[$ i$+1]$;

return a$[$a$.$length$-1]$;

$\}$