Consider the list of n n-vectors:
1 1 1
0 1 1
a1= [ 0 ], a2= [ 0 ] ,, an= [ 1 ]
. . .
. . .
. . .
0 0 1

(The vector ai has its first i entries equal to one, and the remaining entries zero.)
Describe what happens when you run the Gram–Schmidt algorithm on this list of vectors, i. e., say what q1,..., qn are. Is a1,..., an a basis?

i think is 3 and 6. this took me 10 min to think.hope to and hope that my answer is brainliest.(follow me )

the correct answer is 5 6 and 7

y = 2x

step-by-step explanation:

if you divide each number in the sequence, you'll see that they all have a multiple factor of 2. each number in the series, and any other numbers which may continue, will be multiplied by 2. therefore, y is the next number in the sequence, and x is the current one, so, our formula will be y = 2x.

could u provide us some answer choices or hmm idk maybe a table for us to anser with ? ?