Given a $m × n$ binary matrix, filled with $0's$ and $1's$. Your task is to find the largest possible square composed entirely of cells with value $1$, and return the area of that square.

Constraints:

• $m ==$ matrix.length

• $n ==$ matrix[i].length

• $1 <=m, n <= 300$ ...