Background: Imagine we are building stairs out of small bricks. For the first step, we use one brick. For the second step, we stack $2$ bricks. And for the third step, we stack $3$ bricks. And so on$.$

With this in mind, write the function numberOfBricks$($steps$),$ which takes a non$-$negative integer number of steps, and returns the number of bricks that are required to create that many steps.

For example numberOfBricks$(3)$ returns $6,$ which is $1+2+3.$

Hint: The sum from $1$ to n is called the nth triangular number. Here is a helpful formula to calculate the nth triangular number: