Given an integer list flowerbed, each element is either 0 (indicating an empty plot) or 1 (indicating a planted plot), and an integer n. Determine if n new flowers can be planted without violating the rule that no two flowers can be planted in adjacent plots. Return TRUE if it’s possible to plant all n flowers. Otherwise, return FALSE.
Constraints: