Write a Java Program in Finding the length of connected cells of 1s (regions) in a matrix of 0s and 1s.

Given a matrix, each of which may be 0 or 1. The filled cells that are connected form a region. Two cells are connected if they are adjacent to each other horizontally, vertically, or diagonally. There may be several regions in the matrix. How do you find the largest region (in terms of number of cells) in the matrix?

Sample Input:

11000

01100

00100

10001

01011

Sample Output:

5