**Identifying the Binary Tree with the Max-Heap Property**This activity requires you to identify which binary tree among the options below satisfies the max-heap property. In a max-heap, each parent node must be greater than or equal to its children.**Option A:**- Root: 45- Second level: 55 (left child), 25 (right child)- Third level: 60 (left child of 55), 15 (right child of 55), 35 (left child of 25), 15 (right child of 25)**Option B:**- Root: 60- Second level: 54 (left child), 35 (right child)- Third level: 25 (left child of 54), 15 (right child of 54), 55 (left child of 35), 45 (right child of 35)**Option C:**- Root: 45- Second level: 25 (left child), 55 (right child)- Third level: 15 (left child of 25), 35 (right child of 25), 54 (left child of 55), 60 (right child of 55)**Option D:**- Root: 60- Second level: 54 (left child), 55 (right child)- Third level: 25 (left child of 54), 45 (right child of 54), 35 (left child of 55), 15 (right child of 55)Review each tree carefully to determine whether all parent nodes are greater than their respective children and identify the correct max-heap.

Max-heap properties parents should not have lesser value than any of their children. So we need to…

Answered: Identify the binary tree that satisfies…