I want to know which one is better way to do this task
As always in programming, people without knoledge look for a simple solution. There is none. See, there IS a performance difference, it is totally irrelevant for rthe task given (too little data).
In general an array is faster but has serious issues with other elements -insert/delete is slow as all elements have to be copied to a new array.
List has no copy issue but every entry is a node that means a lot more memory use and a lot more memory acccess - every entry is your object + a node object with pointers back and forth to next / last element. This makes random access slower, sometimes significantly so. Not an issue if you ONLY do foreach, especially with only 7 elements. It is a lot more if you have thousands of accesses of a 250.000 item list.
Part of you learning programming is understanding the standard characteristics of EVERY item on the list. The above question is a trainee level beginner question - one I love using on programmer interviews to weed out the wannabes.