Write a recurrence relation to compute the number of binary strings with n digits that do not have two consecutive 1s.

Also, Give a recursive definition for strings of properly nested parentheses and curly braces. For example ({}){}() is properly nested but ({)} is not.