Find Maximum Island Perimeter

You are given an `m x n` binary grid where `1` represents land and `0` represents water. An island is a group of land cells connected vertically or horizontally. For each island, define its **perimeter** as the number of land edges that touch either water or the boundary of the grid. Return the **maximum perimeter** among all islands in the grid. If the grid contains no land, return `0`. You may solve this using either DFS or BFS. Example: - Input: ``` [ [1,1,0,0], [1,0,0,1], [0,0,1,1] ] ``` - Output: `8` Because the island with the largest perimeter has perimeter 8.