Josephus The penultimate number in the (2059, 2)-Josephus permutation is Binary Heap A binary min heap has 1,001,001 distinct keys. The height of the heap is Last person standing The ultimate survivor...

please give answer of all with proper explanation

dont copy from google

Extracted text: Josephus The penultimate number in the (2059, 2)-Josephus permutation is Binary Heap A binary min heap has 1,001,001 distinct keys. The height of the heap is Last person standing The ultimate survivor in the (81, 3)-Josephus permutation is Optimal Decision Tree An optimal decision tree for the median of six numbers has height eight. Circle T or F. Dijkstra's method for solving the MST problem is an example of a greedy (graph) algorithm. Circle T or F.