Give a big-o estimate for the number additions used in this segment of an algorithmi: =0 , for i: =1 to n, for j: = 1 to n, t: =t+i+j

We have a "square" double loop, meaning that both loops go to completion at n.
So there are n^2 executions of t:=t+i+j.
Assuming two additions per execution of the innermost loop, (i.e. ignoring the implied additions in increment of subscripts), we have 2n^2 additions in all.

Therefore the given code section is of O(n^2), i.e. the highest power (if polynomial) and ignore coefficients.

Can you tell us the question

both graphs increase on their domain

neither graph has a y-intercept

step-by-step explanation:

the following points can be visualized easily from the graph

there is a hike in both the graphs so the graphs are increasing on their domain.x-intercept of log x and log 6x are differentthere is a vertical asymptote of both the graphs so there is no y-interceptas both the graphs are increasing so there is no horizontal asymptote