Assignment 6: Code Snippet

Use the code snippet provided below as the basis for your work on each question in Assignment 6. Note that you may need more than two for loops for shapes in some of the questions. It wants me to use this code.

for i in range(3):
for j in range(3-i):
print("*", end=" ")
print("")

how do I create this?
FIRST
*
* *
* * *
* * * *
* * * * *
* * * * * *
* * * * * * *
* * * * * * * *
* * * * * * * * *

I need help with this computer science python problem

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)?