Text-based stimulus: A merge-sort diagram titled 'Merge sort merge step'. It includes three horizontal rows labeled Left, Right, and Output. Left row values: [100, 90, 81, 75] with a pointer arrow under index 1. Right row values: [95, 90, 82, 70] with a pointer arrow under index 1. Output row shows [100, 95] followed by one empty slot. It also includes label 'sort order: descending'. The visual merge diagram for a community service hour log shows merge sort combining two sorted runs in descending order. Left = [100, 90, 81, 75], right = [95, 90, 82, 70], output so far = [100, 95], leftIndex = 1, rightIndex = 1. When current keys are equal, the stable merge takes the left item first. Which trace is next after one comparison-and-append step?