Answer:
$1.75
Step-by-step explanation:
The selling for each candy bar may be determined by a set of linear equations. This pair of linear equations may be solved simultaneously by using the elimination method. This will involve ensuring that the coefficient of one of the unknown variables is the same in both equations.
It may be solved by substitution in that one of the variable is made the subject of the equation and the result is substituted into the second equation
.
Let the cost of a snack bag be s and that of a candy bar be c, then if on Wednesday the students or 23 snack bags and 36 candy bars that raised $114.75 on Thursday the seventh so 37 snack bags and 36 candy bars that raised $146.25
23s + 36c = 114.75
37s + 36c = 146.25
14s = 31.5
s = $2.25
23(2.25) + 36c = 114.75
36c = 114.75 - 51.75
36c = 63
c = 63/36
= $1.75
I think that the answer is
5/6
hope i helped :)
Answer:
D
Step-by-step explanation:
![( {2 x})^{ \frac{1}{3} } - 7 = \sqrt[3]{2x} - 7](https://tex.z-dn.net/?f=%28%20%7B2%20x%7D%29%5E%7B%20%5Cfrac%7B1%7D%7B3%7D%20%7D%20%20-%207%20%3D%20%20%5Csqrt%5B3%5D%7B2x%7D%20%20-%207)
Answer:
![[4,0,3,1,2,5]](https://tex.z-dn.net/?f=%5B4%2C0%2C3%2C1%2C2%2C5%5D)
and ![[6,9,8,7]](https://tex.z-dn.net/?f=%5B6%2C9%2C8%2C7%5D)
Step-by-step explanation:
GIVEN: an array of ten integers 
.
TO FIND: If we partition this array using Quick sort's partition function and using 
for the pivot. List the elements of the resulting array after the partition finishes.
SOLUTION:
quick sort is a divide and conquer algorithm in which an array is partitioned into sub-arrays about an pivot element by checking whether elements are greater than pivot or and then sub arrays are sorted recursively.
Here is the pivot element.
two arrays will be created, in first array element less than or equal to pivot element are stored in other elements greater than pivot element are stored.
Starting from first element of array
elements in first array will be ![=[4,0,3,1,2,5]](https://tex.z-dn.net/?f=%3D%5B4%2C0%2C3%2C1%2C2%2C5%5D)
elements in second array will be ![=[6,9,8,7]](https://tex.z-dn.net/?f=%3D%5B6%2C9%2C8%2C7%5D)
Hence the resulting array after the partition finishes are and
