Dynamic Theater Seating Arrangement

You are given a row of theater seats represented as an array of integers. In the array, a 0 indicates an available seat, whereas a 1 indicates an occupied seat.

Write a function that takes two parameters:

1. An array of integers (only 0s and 1s) representing the row of seats.
2. An integer k representing the minimum number of contiguous available seats needed for a group.

Your task is to identify every contiguous block of available seats (0s) that has a length of at least k. For each such block, return an object (or a similar structure, depending on the language you choose) that contains:

• The starting index of the block.
• The total number of contiguous available seats in that block.

For example, given the array:

[0, 0, 1, 0, 0, 0, 1, 0, 0]

and k = 2, your function should find all contiguous blocks of 0s with a length of 2 or more.

Implement your solution in a programming language of your choice, ensuring that it efficiently handles the input and returns the correct results.