Suppose that we would like to compute an iceberg cube for thedimensions, A, B, C, D, where we wish to materialize all cells thatsatisfy a minimum support count of at least v, and where cardinality(A) <cardinality(B) <cardinality(C) <cardinality(D).Showthe BUC processing tree (which shows the order in which the BUCalgorithm explores the lattice of a data cube, starting from all) for the construction of the above iceberg cube.