Michael Sipser Edition 3 Exercise 4 Question 2 (Page No. 211)

Question

Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable.