You are given a warehouse layout represented as a grid of cells. Each cell can be either empty $(\text{'}$E$\text{'})$ or blocked $(\text{'}$B$\text{'}).$ Your task is to find the shortest path from the entrance of the warehouse to the exit, while minimizing the number of blocked cells you need to pass through. Here are the rules and requirements:

You start at the cell marked as $\text{'}$S$\text{'}($entrance$)$ and must reach the cell marked as $\text{'}$E$\text{'}($exit$).$

You can move horizontally or vertically to an adjacent empty cell $(\text{'}$E$\text{'}).$

You cannot move through blocked cells $(\text{'}$B$\text{'}).$

Your goal is to find the shortest path while minimizing the