if you follow me and like and mark in brainliest answer only I will tell the answer
Answer:
n := length(A)
repeat
swapped := false
for i := 1 to n-1 inclusive do
<em> /* if this pair is out of order */</em>
if A[i-1] > A[i] then
<em> /* swap them and remember something changed */</em>
swap(A[i-1], A[i])
swapped := true
end if ⇒
end for
until not swapped
end procedure

Explanation:
This is pseudocode
I would say it is <span> B. the history of modern interior design
Because this subject stretches pretty far into history</span>