Given the following heap to start:

[0]	[1]	[2]	[3]	[4]	[5]	[6]
V	T	Q	G	H	B	F

List all the letters in the array, in order, after the first pass of the heapsort. Include the entire array (i.e. both the sorted and unsorted parts of the array)