Solving 5 variables Karnaugh map - grouping
This answer is correct ?
Your answer is NOT correct; This is not the proper way to group a 5 variables K-map
Lets first look why a K-map is not practical for functions with more than 4 variables
The way the K-Map works is by grouping the numbers that their binary representation has a Hamming distance = 1 [Only 1 bit difference]
In the image you posted

This doesnt seem like the only way to arrange the values of inputs C,D,E since '011' is not next to '111'. We cant put all the values of a HD=1 of 3-bits on a line [1-D]
Having 2-bits guarantees that you can arrange the values of the 2 inputs in a 1-D [Line] such that all the binary values are surrounded by all the other values of hamming distance = 1 bit, but more than 2 bits require a 2-D or more in order to make sure that all the binary values are surrounded by all the possible values of a hamming distance = 1 bit
Thats why the way you are taking the groups is not correct
You might want to check This PDF
What is the correct answer?
According to my Python script which uses Quine–McCluskey algorithm, the correct answer is

What tools can i use to solve K-Map or to reduce a Boolean equation

You can use my python script i provided above [Its a terrible code BUT works]
You can use This tool to solve up to 8 variables K-Map
You can use Logic Friday