The ASCII character countdown! Since this is a answer-chaining challenge, you might want to sort answers by oldest.

Your task is simple: Choose any printable ASCII character that's not chosen in the previous answers. And then, you need to print your chosen character in your program to standard output. (You can ONLY print your chosen character, without printing other garbage to STDOUT)
The catch
Let's say you picked x as your chosen character, and your answer is the answer numbered y. You have to insert y x's into the previous source code, at any position you like. For the first answer, the previous answer is the empty program.
An example
Answers have to start with the number 1. So for example, I chose the character #, and I posted a 1 byte answer in /// that prints the # mark.
#

And then, the second answer (numbered 2) has to insert 2 of their picked x character into the previous source code, such that the modified code will print their x character. So assume this is written in Keg:
x#x

And then, the third answer has to do the same, and so on, until 95 is reached.
Answer format
I'd love to see an explanation of your code as well, preferably with an online interpreter link!
# [{Language name}]({link-to-language}), {code-length} bytes

\$y= {The number of your answer}\$. Used so far: &lt;code&gt;{Characters used in answers so far}&lt;/code&gt;

    {your code}

The winning criterion &amp; other rules

The first user whose answer stays without a succeeding answer for a month wins the challenge. If that's not satisfied, the first person who reaches the number 95 wins the challenge.
You are not allowed to put any other character in your code other than printable ASCII characters.
You need to wait 2 answers before you post a new answer after your submission.
Please make sure your answer is valid. If yours is not valid, chaining answers aren't allowed to be posted.
You can answer in a language that is used in previous answers.
You could only insert y x's into the source code.
Your are not allowed to take input.
Your program can output to STDERR, as long as the output to STDOUT is as intended.
2sable, 36 bytes
//9#999999//,#,#,221'/,#q',#q,qq2///

\$y=8\$. Used so far: 1'2q#,9/
Try it online.
Maybe this opens up some other languages that use // to comment. :)
Explanation:

2sable is an old version of 05AB1E (legacy) (which of itself is an old version of 05AB1E).
The legacy version outputs a leading newline however: try it online.
And the latest 05AB1E version outputs three leading newline: try it online.
//                                    # Divide twice, no-ops with an empty stack
  9                                   # Push 9
   #                                  # Pop and split it by spaces
                                      # (since it contains no spaces, it only pops)
    999999                            # Push 999999
          /                           # Divide the empty stack by this, popping the integer
           /                          # No-op divide again with an empty stack
            ,                         # No-op print (which would output a newline in the
                                      # newer versions)
             #,#,                     # Some more no-ops
                 221                  # Push 221
                    '/               '# Push &quot;/&quot;
                      ,               # Pop and print this &quot;/&quot; to STDOUT
                       #              # Split the 221 on spaces, so it just pops
                        q             # Exit the program
                         ',#q,qq2/// '# No-ops