Post History

Tile pyramids on top of each other!

The task
=
Given a positive integer as input, output tiled pyramids of this height.

How?
=
Let's say the inputted integer was `n`. From there, we output `n` lines of output, each having:

 1. A decreasing indentation of spaces starting with `n-1` spaces and ending with `0` spaces
 2. An increasing number of the symbol `/` starting with `1` symbol and ending with `n` symbols
 3. An increasing number of the symbol `\` starting with `1` symbol and ending with `n` symbols

For example, with an input of 4, the output should be the following:

```
   /\
  //\\
 ///\\\
////\\\\
```

Rules
=
 1. You may output an optional newline after the required output
 2. Input will always be a positive integer
 3. This is code-golf, so lowest byte-count *for each language* is the winner

Test cases
=
```
Input: 1
Output:
/\


Input: 7
Output:
      /\
     //\\
    ///\\\
   ////\\\\
  /////\\\\\
 //////\\\\\\
///////\\\\\\\


Input: 11
Output:
          /\
         //\\
        ///\\\
       ////\\\\
      /////\\\\\
     //////\\\\\\
    ///////\\\\\\\
   ////////\\\\\\\\
  /////////\\\\\\\\\
 //////////\\\\\\\\\\
///////////\\\\\\\\\\\
```