Which of the following can be said to be typical attributes of a backtracking algorithm? exponential time complexity divides large problems up into smaller sub-problems can be implemented recursively or iteratively guesses what the answer might be and then checks to see if the guess was correct. uses a data structure to avoid recursion works from smaller sub-problems towards a larger solution

$18 was the price of the t-shirt

step-by-step explanation:

y > 1/3x

y < = -x + 4

hope this : )

x =±sqrt(1/3)

step-by-step explanation:

x+4/6x=1/x

multiply each side by 6x to get rid of the fractions

6x*(x+4/6x)=1/x*6x

distribute

6x^2 +4 = 6

subtract 4 from each side

6x^2 +4-4 = 6-4

6x^2 =2

divide by 6

6x^2/6 = 2/6

x^2 = 1/3

take the square root of each side

sqrt(x^2) = ±sqrt(1/3)

x =±sqrt(1/3)

an

y = 6x -3y -12

y +3y +12 = 6x

=> . x = { 2y / 3 +2 } this is equation of line in terms of x

=> . if line meets the x-axis the co-ordinates of meeting point would be ( x , 0 )

=> . x = 2 ( 0 ) / 3 + 2

=> . x = 2

so, the point is ( 2 , 0 )