Incorporate sparsity in lower bound costs

So far, the codegen optimizer computes the lower bound costs for cost-based pruning without proper awareness of sparsity exploiting operators. This led to suboptimal plans because sub areas of the search space are pruned too eagerly.