First make the equation:
1. x
2. 3x
x + 3x = 48
Now solve it:
x + 3x = 48
4x= 48
x=12
Now plug in x
1. x = 12
2. 3x = 36
So Kayla sold 12 blue t-shirts and 36 white t-shirts.
Answer:
The running time is quadratic (O(n²) )
Step-by-step explanation:
For the set up, we have a constant running time of C. The, a log-linearsorting is called, thus, its execution time, denoted by T(n), is O(n*log(n)). Then, we call n times a linear iteration, with a running time of an+b, for certain constants a and b, thus, the running time of the algorithm is
C + T(n) + n*(a*n+b) = an²+bn + T + C
Since T(n) is O(n*log(n)) and n² is asymptotically bigger than n*log(n), then the running time of the algorith is quadratic, therefore, it is O(n²).
Answer:
51 dollars
Step-by-step explanation:
4 times 12.75 =51
I think it’s the second one please correct me if I’m wrong not perfect at this
To find the volume of a square-based pyramid, use the formula V = A(h/3), where V is the volume and A is the area of the base.
