Give a BNF grammar for the language below:

$3.$ The set of all strings consisting of an open bracket $($the symbol $[)$ followed by a list of one

or more digits separated by commas, followed by a closing bracket $($the symbol $]).$