Analyze the time complexity of the program shown in Figure 1, briefly describe how you calculate the number of operations and provide the final program complexity function. \begin{tabular}{l|l} 1 & def function (seq): \\ 2 & d=0 \\ 3 & n= len ( seq ) \\ 4 & for i in range (n1): \\ 5 & for j in range (i+1,n): \\ 6 & d+=seq[i]seq[j] \\ 7 & return d \end{tabular}