An urn containing n balls can be represented by the set U={b1,b2,,bn}, with n3. Interpret the following algorithm in the context of urn problems. for i in {1,2,,n} do [for j in {i+1,i+2,,n} do [ for k in {j+1,j+2,,n} do print bi,bj,bk ] ] a. Does it represent drawing an ordered or unordered set of three balls? b. Does it represent drawing with or without replacement? c. How many lines does it print? d. What is the big- estimate of the algorithm