Problem 4: Determine the minimal cut sets of the following fault tree using top-down and bottom- up Boolean operations (Consider Remove Safety Fence and the light is poor also as a basic events). late the Mime sham and New C The Problem 4: Determine the minimal cut sets of the following fault tree using top-down and bottom- up Boolean operations (Consider Remove Safety Fence and the light is poor also as a basic events). Fallah and le Problem 4: Determine the minimal cut sets of the following fault tree using top-down and bottom- up Boolean operations (Consider Remove Safety Fence and the light is poor also as a basic events). late the Mime sham and New C The Problem 4: Determine the minimal cut sets of the following fault tree using top-down and bottom- up Boolean operations (Consider Remove Safety Fence and the light is poor also as a basic events). Fallah and le