Count the number of times a sequence of numbers appears regardless of order?

I want to create a code that will analyze an array, and list the number of times a sequence appears regardless of the order?

A=[1, 2, 3; 3, 2, 1; 2, 3, 2; 2, 1, 3]; 

For example, in the above array I want to know how many times equal sequences appear and the numbers in that sequence. So in this case the code would recognize that "1, 2, 3", and "3, 2, 1" and "2,1,3" are the same regardless of order, list the number sequence and how many times it appears. So, "1,2,3" and appears 3 times. I tried my best to word this without sounding confusing. I'll answer any questions regarding what i'm trying to achieve I'm just not sure how to code something like this.

[Hudson Harrell]

The array I used is just an example, I will be using this for a large data set.

[dpb]

Presuming the target array is also complete in the number of elements in each row--

[uA,~,iC]=unique(sort(A,2),'rows');     % the unique sets of elements
n=histcounts(iC);                       % the number of occurrences each set

Applied to your example the above yields:

>> arrayfun(@(r,n) fprintf(['Elements ' repmat('%d ',1,size(A,2)) 'appear %d times\n'],uA(r,:),n), ...
                                                                               [1:size(uA,1)],n)
Elements 1 2 3 appear 3 times
Elements 2 2 3 appear 1 times
>> 

[Hudson Harrell]

Thank you so much for your response, I appreciate the work it performs well!

[Walter Roberson]

Will the sequence to be found always occupy the whole row?

Is it necessary to figure out what the sequences are and how long they are?