Question: 
Write a function to find the largest integers from a given list of numbers using heap queue algorithm.


Model's Code:
import heapq

def heap_queue_largest(nums, n):
    return heapq.nlargest(n, nums)



Sample Correct Code:
import heapq as hq
def heap_queue_largest(nums,n):
  largest_nums = hq.nlargest(n, nums)
  return largest_nums


Asserts:
assert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65] 
assert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],2)==[85, 75] 
assert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[85, 75, 65, 58, 35]


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 4 of 974: 3/4 (75.0%): success