# a114_nested_loops_2.py import turtle as trtl

painter = trtl. Turtle()

painter. shape("circle")

painter. hideturtle()

painter. penup()

x = -200

while (x < 200):

x = x + 50

y = 200

painter. goto(x, y)

painter. color("red")

painter. stamp()

wn = trtl. Screen()

wn. mainloop()

Dameas communication challenge is due to which factor

Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?

2. fabulously fit offers memberships for$35 per month plus a $50 enrollmentfee. the fitness studio offersmemberships for $40 per month plus a$35 enrollment fee. in how many monthswill the fitness clubs cost the same? what will the cost be?